Recognised as Number
1,471,963
- Positive
- Odd
- Composite
- 7 digits
1,471,963 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,471,963
Digit count7
Digit sum31
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation311 × 4,733
Distinct prime factors2311, 4,733
Number of divisors4
Sum of divisors σ(n)1,477,008
Aliquot sum5,045sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,466,920integers below n that share no factor with it
Carmichael function λ(n)733,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,466,920
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 311, 4,733, 1,471,9634 in total
Arithmetic
Previous number1,471,962
Next number1,471,964
Double2,943,926
Half735,981.5
Square2,166,675,073,369
Cube3,189,265,541,021,453,347
Square root1,213.244822779≈irrational, shown to 9 decimal places
Cube root113.753726078≈
Negation-1,471,963
Reciprocal6.79364903 × 10^-7≈
Representations
Decimal1,471,963
Binary10110011101011101101121 bits
Octal5472733
Hexadecimal1675DB
Base 36VJRV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-one thousand, nine hundred and sixty-three
Ordinalone million, four hundred and seventy-one thousand, nine hundred and sixty-third
Scientific notation1.471963 × 10^6
Engineering notation1.471963 × 10^6
In other bases
Ternary2202210011011base 3; the most digit-efficient integer base after e: 13 digits
Quinary334100323base 5; one hand: 9 digits
Septenary15340303base 7: 8 digits
Nonary2683134base 9; each digit is two ternary digits: 7 digits
Duodecimal5ab9b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal93ji3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:48:52:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10T10011011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111000101000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100111010111011011
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 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
Bytes316 75 db
Gray code111010100111100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100111010111011011
64-bit0000000000000000000000000000000000000000000101100111010111011011
One's complement11111111111010011000101000100100at 32 bits, every bit flipped
Bits reversed11011011101011100110100000000000at 32 bits
Rotated left by 100000000001011001110101110110110at 32 bits, wrapping
Shifted left by 11011001110101110110110= 2,943,926, no wrap
Shifted right by 110110011101011101101= 735,981, discarding the low bit
These bits as a double7.2724635 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,471,963 to the power 22,166,675,073,369
1,471,963 to the power 33,189,265,541,021,453,347
1,471,963 to the power 44,694,480,873,558,561,533,010,161
1,471,963 to the power 56,910,102,150,085,880,909,814,235,616,043
First ten multiples1,471,963, 2,943,926, 4,415,889, 5,887,852, 7,359,815, 8,831,778, 10,303,741, 11,775,704, 13,247,667, 14,719,630
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached11,177,7287× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,471,963 → 4,415,890 → 2,207,945 → 6,623,836 → 3,311,918 → 1,655,959 → 4,967,878 → 2,483,939 → 7,451,818 → 3,725,909 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,196,300%
1,471,963% as a decimal14,719.63
1,471,963% of 1001,471,963
1,471,963% of 1,00014,719,630
As a fraction of 1001,471,963/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,963
Nerdulate something else
Nothing in mind? Surprise me · today’s page