Recognised as Number

1,447,965

Positive
Odd
Composite
7 digits

1,447,965 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,447,965

Digit count7

Digit sum36

Digit product30,240

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 23 × 1,399

Distinct prime factors43, 5, 23, 1,399

Number of divisors24

Sum of divisors σ(n)2,620,800

Aliquot sum1,172,835sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)738,144integers below n that share no factor with it

Carmichael function λ(n)30,756the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 738,144

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 23, 45, 69, 115, 207, 345, 1,035, 1,399, 4,197, 6,995, 12,591, 20,985, 32,177, 62,955, 96,531, 160,885, 289,593, 482,655, 1,447,96524 in total

Arithmetic

Previous number1,447,964

Next number1,447,966

Double2,895,930

Half723,982.5

Square2,096,602,641,225

Cube3,035,807,243,401,357,125

Square root1,203.314173439≈irrational, shown to 9 decimal places

Cube root113.132144986≈

Negation-1,447,965

Reciprocal6.90624428 × 10^-7≈

Representations

Decimal1,447,965

Binary10110000110000001110121 bits

Octal5414035

Hexadecimal16181D

Base 36V199

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, four hundred and forty-seven thousand, nine hundred and sixty-five

Ordinalone million, four hundred and forty-seven thousand, nine hundred and sixty-fifth

Scientific notation1.447965 × 10^6

Engineering notation1.447965 × 10^6

In other bases

Ternary2201120020100base 3; the most digit-efficient integer base after e: 13 digits

Quinary332313330base 5; one hand: 9 digits

Septenary15210321base 7: 8 digits

Nonary2646210base 9; each digit is two ternary digits: 7 digits

Duodecimal599b39base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal90ji5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:42:12:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10T1TTT01T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010100110100001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101100001100000011101

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes316 18 1d

Gray code111010001010000010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101100001100000011101

64-bit0000000000000000000000000000000000000000000101100001100000011101

One's complement11111111111010011110011111100010at 32 bits, every bit flipped

Bits reversed10111000000110000110100000000000at 32 bits

Rotated left by 100000000001011000011000000111010at 32 bits, wrapping

Shifted left by 11011000011000000111010= 2,895,930, no wrap

Shifted right by 110110000110000001110= 723,982, discarding the low bit

These bits as a double7.15389763 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,447,969+4

Previous prime1,447,961−4

Distance to nearest prime4

Nearest square below1,447,209

Nearest square above1,449,616

Powers & multiples

1,447,965 to the power 22,096,602,641,225

1,447,965 to the power 33,035,807,243,401,357,125

1,447,965 to the power 44,395,742,635,191,646,069,500,625

1,447,965 to the power 56,364,881,484,765,271,801,024,472,478,125

First ten multiples1,447,965, 2,895,930, 4,343,895, 5,791,860, 7,239,825, 8,687,790, 10,135,755, 11,583,720, 13,031,685, 14,479,650

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time

Highest value reached4,343,8963× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,447,965 → 4,343,896 → 2,171,948 → 1,085,974 → 542,987 → 1,628,962 → 814,481 → 2,443,444 → 1,221,722 → 610,861 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage144,796,500%

1,447,965% as a decimal14,479.65

1,447,965% of 1001,447,965

1,447,965% of 1,00014,479,650

As a fraction of 1001,447,965/100

Read another way

As seconds16 days, 18 hours and 12 minutes

As bytes1.381 MiB

As a 24-bit colour#16181D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.