Recognised as Number
1,200,471
- Positive
- Odd
- Composite
- 7 digits
1,200,471 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,200,471
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 400,157
Distinct prime factors23, 400,157
Number of divisors4
Sum of divisors σ(n)1,600,632
Aliquot sum400,161sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)800,312integers below n that share no factor with it
Carmichael function λ(n)400,156the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 800,312
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 400,157, 1,200,4714 in total
Arithmetic
Previous number1,200,470
Next number1,200,472
Double2,400,942
Half600,235.5
Square1,441,130,621,841
Cube1,730,035,518,732,087,111
Square root1,095.660075023≈irrational, shown to 9 decimal places
Cube root106.279758216≈
Negation-1,200,471
Reciprocal8.33006378 × 10^-7≈
Representations
Decimal1,200,471
Binary10010010100010101011121 bits
Octal4450527
Hexadecimal125157
Base 36PQAF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred thousand, four hundred and seventy-one
Ordinalone million, two hundred thousand, four hundred and seventy-first
Scientific notation1.200471 × 10^6
Engineering notation1.200471 × 10^6
In other bases
Ternary2020222201220base 3; the most digit-efficient integer base after e: 13 digits
Quinary301403341base 5; one hand: 9 digits
Septenary13126626base 7: 8 digits
Nonary2228656base 9; each digit is two ternary digits: 7 digits
Duodecimal49a873base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7a13bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:27:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1000T1T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100101011010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100101000101010111
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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
Bytes312 51 57
Gray code110110111100111111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100101000101010111
64-bit0000000000000000000000000000000000000000000100100101000101010111
One's complement11111111111011011010111010101000at 32 bits, every bit flipped
Bits reversed11101010100010100100100000000000at 32 bits
Rotated left by 100000000001001001010001010101110at 32 bits, wrapping
Shifted left by 11001001010001010101110= 2,400,942, no wrap
Shifted right by 110010010100010101011= 600,235, discarding the low bit
These bits as a double5.9311148 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,200,471 to the power 21,441,130,621,841
1,200,471 to the power 31,730,035,518,732,087,111
1,200,471 to the power 42,076,857,469,207,827,346,229,281
1,200,471 to the power 52,493,207,162,917,389,702,155,211,191,351
First ten multiples1,200,471, 2,400,942, 3,601,413, 4,801,884, 6,002,355, 7,202,826, 8,403,297, 9,603,768, 10,804,239, 12,004,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1315the total stopping time
Highest value reached720,170,836599× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,200,471 → 3,601,414 → 1,800,707 → 5,402,122 → 2,701,061 → 8,103,184 → 4,051,592 → 2,025,796 → 1,012,898 → 506,449 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage120,047,100%
1,200,471% as a decimal12,004.71
1,200,471% of 1001,200,471
1,200,471% of 1,00012,004,710
As a fraction of 1001,200,471/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,200,471
Nerdulate something else
Nothing in mind? Surprise me · today’s page