Recognised as Number
4,667,477
- Positive
- Odd
- Prime
- 7 digits
4,667,477 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,667,477
Digit count7
Digit sum41
Digit product197,568
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,667,477
Distinct prime factors14,667,477
Number of divisors2
Sum of divisors σ(n)4,667,478
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,667,476integers below n that share no factor with it
Carmichael function λ(n)4,667,476the 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,667,4772 in total
Arithmetic
Previous number4,667,476
Next number4,667,478
Double9,334,954
Half2,333,738.5
Square21,785,341,545,529
Cube101,682,580,600,901,060,333
Square root2,160.43444705≈irrational, shown to 9 decimal places
Cube root167.119603088≈
Negation-4,667,477
Reciprocal2.14248512 × 10^-7≈
Representations
Decimal4,667,477
Binary1000111001110000101010123 bits
Octal21634125
Hexadecimal473855
Base 362S1G5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and sixty-seven thousand, four hundred and seventy-seven
Ordinalfour million, six hundred and sixty-seven thousand, four hundred and seventy-seventh
Scientific notation4.667477 × 10^6
Engineering notation4.667477 × 10^6
In other bases
Ternary22210010120112base 3; the most digit-efficient integer base after e: 14 digits
Quinary2143324402base 5; one hand: 10 digits
Septenary54446543base 7: 8 digits
Nonary8703515base 9; each digit is two ternary digits: 7 digits
Duodecimal1691105base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1938dhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:36:31:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T10011TT1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110100100001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001110011100001010101
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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 38 55
Gray code11001001010010001111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001110011100001010101
64-bit0000000000000000000000000000000000000000010001110011100001010101
One's complement11111111101110001100011110101010at 32 bits, every bit flipped
Bits reversed10101010000111001110001000000000at 32 bits
Rotated left by 100000000100011100111000010101010at 32 bits, wrapping
Shifted left by 1100011100111000010101010= 9,334,954, no wrap
Shifted right by 11000111001110000101010= 2,333,738, discarding the low bit
These bits as a double2.30604004 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,667,477 to the power 221,785,341,545,529
4,667,477 to the power 3101,682,580,600,901,060,333
4,667,477 to the power 4474,601,106,255,351,878,379,889,841
4,667,477 to the power 52,215,189,747,621,411,019,244,933,095,401,157
First ten multiples4,667,477, 9,334,954, 14,002,431, 18,669,908, 23,337,385, 28,004,862, 32,672,339, 37,339,816, 42,007,293, 46,674,770
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1193the total stopping time
Highest value reached14,002,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,667,477 → 14,002,432 → 7,001,216 → 3,500,608 → 1,750,304 → 875,152 → 437,576 → 218,788 → 109,394 → 54,697 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage466,747,700%
4,667,477% as a decimal46,674.77
4,667,477% of 1004,667,477
4,667,477% of 1,00046,674,770
As a fraction of 1004,667,477/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,667,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page