Recognised as Number
4,666,471
- Positive
- Odd
- Prime
- 7 digits
4,666,471 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,666,471
Digit count7
Digit sum34
Digit product24,192
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,666,471
Distinct prime factors14,666,471
Number of divisors2
Sum of divisors σ(n)4,666,472
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,666,470integers below n that share no factor with it
Carmichael function λ(n)4,666,470the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,666,4712 in total
Arithmetic
Previous number4,666,470
Next number4,666,472
Double9,332,942
Half2,333,235.5
Square21,775,951,593,841
Cube101,616,846,610,062,805,111
Square root2,160.201610961≈irrational, shown to 9 decimal places
Cube root167.107595573≈
Negation-4,666,471
Reciprocal2.14294699 × 10^-7≈
Representations
Decimal4,666,471
Binary1000111001101000110011123 bits
Octal21632147
Hexadecimal473467
Base 362S0O7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and sixty-six thousand, four hundred and seventy-one
Ordinalfour million, six hundred and sixty-six thousand, four hundred and seventy-first
Scientific notation4.666471 × 10^6
Engineering notation4.666471 × 10^6
In other bases
Ternary22210002012021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2143311341base 5; one hand: 10 digits
Septenary54443605base 7: 8 digits
Nonary8702167base 9; each digit is two ternary digits: 7 digits
Duodecimal1690607base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19363bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:36:14:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1001T1TT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110111010110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001110011010001100111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes347 34 67
Gray code11001001010111001010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001110011010001100111
64-bit0000000000000000000000000000000000000000010001110011010001100111
One's complement11111111101110001100101110011000at 32 bits, every bit flipped
Bits reversed11100110001011001110001000000000at 32 bits
Rotated left by 100000000100011100110100011001110at 32 bits, wrapping
Shifted left by 1100011100110100011001110= 9,332,942, no wrap
Shifted right by 11000111001101000110011= 2,333,235, discarding the low bit
These bits as a double2.30554301 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,666,471 to the power 221,775,951,593,841
4,666,471 to the power 3101,616,846,610,062,805,111
4,666,471 to the power 4474,192,067,817,306,388,229,133,281
4,666,471 to the power 52,212,803,532,899,493,558,785,991,810,921,351
First ten multiples4,666,471, 9,332,942, 13,999,413, 18,665,884, 23,332,355, 27,998,826, 32,665,297, 37,331,768, 41,998,239, 46,664,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1268the total stopping time
Highest value reached170,284,98436× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,666,471 → 13,999,414 → 6,999,707 → 20,999,122 → 10,499,561 → 31,498,684 → 15,749,342 → 7,874,671 → 23,624,014 → 11,812,007 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage466,647,100%
4,666,471% as a decimal46,664.71
4,666,471% of 1004,666,471
4,666,471% of 1,00046,664,710
As a fraction of 1004,666,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 4,666,471
Nerdulate something else
Nothing in mind? Surprise me · today’s page