Recognised as Number
1,471,961
- Positive
- Odd
- Composite
- 7 digits
1,471,961 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,471,961
Digit count7
Digit sum29
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation883 × 1,667
Distinct prime factors2883, 1,667
Number of divisors4
Sum of divisors σ(n)1,474,512
Aliquot sum2,551sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,469,412integers below n that share no factor with it
Carmichael function λ(n)14,994the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,469,412
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 883, 1,667, 1,471,9614 in total
Arithmetic
Previous number1,471,960
Next number1,471,962
Double2,943,922
Half735,980.5
Square2,166,669,185,521
Cube3,189,252,540,988,676,681
Square root1,213.243998543≈irrational, shown to 9 decimal places
Cube root113.753674558≈
Negation-1,471,961
Reciprocal6.79365826 × 10^-7≈
Representations
Decimal1,471,961
Binary10110011101011101100121 bits
Octal5472731
Hexadecimal1675D9
Base 36VJRT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-one thousand, nine hundred and sixty-one
Ordinalone million, four hundred and seventy-one thousand, nine hundred and sixty-first
Scientific notation1.471961 × 10^6
Engineering notation1.471961 × 10^6
In other bases
Ternary2202210011002base 3; the most digit-efficient integer base after e: 13 digits
Quinary334100321base 5; one hand: 9 digits
Septenary15340301base 7: 8 digits
Nonary2683132base 9; each digit is two ternary digits: 7 digits
Duodecimal5ab9b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal93ji1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:48:52:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10T1001101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111000101000101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100111010111011001
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 75 d9
Gray code111010100111100110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100111010111011001
64-bit0000000000000000000000000000000000000000000101100111010111011001
One's complement11111111111010011000101000100110at 32 bits, every bit flipped
Bits reversed10011011101011100110100000000000at 32 bits
Rotated left by 100000000001011001110101110110010at 32 bits, wrapping
Shifted left by 11011001110101110110010= 2,943,922, no wrap
Shifted right by 110110011101011101100= 735,980, discarding the low bit
These bits as a double7.27245362 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,471,961 to the power 22,166,669,185,521
1,471,961 to the power 33,189,252,540,988,676,681
1,471,961 to the power 44,694,455,359,486,233,516,041,441
1,471,961 to the power 56,910,055,205,404,715,772,505,875,535,801
First ten multiples1,471,961, 2,943,922, 4,415,883, 5,887,844, 7,359,805, 8,831,766, 10,303,727, 11,775,688, 13,247,649, 14,719,610
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached4,967,8723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,471,961 → 4,415,884 → 2,207,942 → 1,103,971 → 3,311,914 → 1,655,957 → 4,967,872 → 2,483,936 → 1,241,968 → 620,984 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,196,100%
1,471,961% as a decimal14,719.61
1,471,961% of 1001,471,961
1,471,961% of 1,00014,719,610
As a fraction of 1001,471,961/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,471,961
Nerdulate something else
Nothing in mind? Surprise me · today’s page