Recognised as Number
5,264,477
- Positive
- Odd
- Prime
- 7 digits
5,264,477 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,264,477
Digit count7
Digit sum35
Digit product47,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,264,477
Distinct prime factors15,264,477
Number of divisors2
Sum of divisors σ(n)5,264,478
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,264,476integers below n that share no factor with it
Carmichael function λ(n)5,264,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, 5,264,4772 in total
Arithmetic
Previous number5,264,476
Next number5,264,478
Double10,528,954
Half2,632,238.5
Square27,714,718,083,529
Cube145,903,495,912,222,499,333
Square root2,294.444813021≈irrational, shown to 9 decimal places
Cube root173.960939398≈
Negation-5,264,477
Reciprocal1.89952392 × 10^-7≈
Representations
Decimal5,264,477
Binary1010000010101000101110123 bits
Octal24052135
Hexadecimal50545D
Base 3634U3H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, two hundred and sixty-four thousand, four hundred and seventy-seven
Ordinalfive million, two hundred and sixty-four thousand, four hundred and seventy-seventh
Scientific notation5.264477 × 10^6
Engineering notation5.264477 × 10^6
In other bases
Ternary100220110111122base 3; the most digit-efficient integer base after e: 15 digits
Quinary2321430402base 5; one hand: 10 digits
Septenary62514221base 7: 8 digits
Nonary10813448base 9; each digit is two ternary digits: 8 digits
Duodecimal191a6a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ci13hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:22:21:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010T0111TTTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100000101010110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100000101010001011101
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 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
Bytes350 54 5d
Gray code11110000111111001110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100000101010001011101
64-bit0000000000000000000000000000000000000000010100000101010001011101
One's complement11111111101011111010101110100010at 32 bits, every bit flipped
Bits reversed10111010001010100000101000000000at 32 bits
Rotated left by 100000000101000001010100010111010at 32 bits, wrapping
Shifted left by 1101000001010100010111010= 10,528,954, no wrap
Shifted right by 11010000010101000101110= 2,632,238, discarding the low bit
These bits as a double2.60099723 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,264,477 to the power 227,714,718,083,529
5,264,477 to the power 3145,903,495,912,222,499,333
5,264,477 to the power 4768,105,598,449,489,366,621,093,841
5,264,477 to the power 54,043,674,256,608,572,432,321,316,240,786,157
First ten multiples5,264,477, 10,528,954, 15,793,431, 21,057,908, 26,322,385, 31,586,862, 36,851,339, 42,115,816, 47,380,293, 52,644,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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Highest value reached15,793,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,264,477 → 15,793,432 → 7,896,716 → 3,948,358 → 1,974,179 → 5,922,538 → 2,961,269 → 8,883,808 → 4,441,904 → 2,220,952 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage526,447,700%
5,264,477% as a decimal52,644.77
5,264,477% of 1005,264,477
5,264,477% of 1,00052,644,770
As a fraction of 1005,264,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 5,264,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page