Recognised as Number
5,264,473
- Positive
- Odd
- Prime
- 7 digits
5,264,473 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,264,473
Digit count7
Digit sum31
Digit product20,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,264,473
Distinct prime factors15,264,473
Number of divisors2
Sum of divisors σ(n)5,264,474
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,264,472integers below n that share no factor with it
Carmichael function λ(n)5,264,472the 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,4732 in total
Arithmetic
Previous number5,264,472
Next number5,264,474
Double10,528,946
Half2,632,236.5
Square27,714,675,967,729
Cube145,903,163,335,858,191,817
Square root2,294.44394135≈irrational, shown to 9 decimal places
Cube root173.960895339≈
Negation-5,264,473
Reciprocal1.89952537 × 10^-7≈
Representations
Decimal5,264,473
Binary1010000010101000101100123 bits
Octal24052131
Hexadecimal505459
Base 3634U3D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, two hundred and sixty-four thousand, four hundred and seventy-three
Ordinalfive million, two hundred and sixty-four thousand, four hundred and seventy-third
Scientific notation5.264473 × 10^6
Engineering notation5.264473 × 10^6
In other bases
Ternary100220110111111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2321430343base 5; one hand: 10 digits
Septenary62514214base 7: 8 digits
Nonary10813444base 9; each digit is two ternary digits: 8 digits
Duodecimal191a6a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ci13dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:22:21:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010T0110111111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100000101010110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100000101010001011001
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 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
Bytes350 54 59
Gray code11110000111111001110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100000101010001011001
64-bit0000000000000000000000000000000000000000010100000101010001011001
One's complement11111111101011111010101110100110at 32 bits, every bit flipped
Bits reversed10011010001010100000101000000000at 32 bits
Rotated left by 100000000101000001010100010110010at 32 bits, wrapping
Shifted left by 1101000001010100010110010= 10,528,946, no wrap
Shifted right by 11010000010101000101100= 2,632,236, discarding the low bit
These bits as a double2.60099525 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,264,473 to the power 227,714,675,967,729
5,264,473 to the power 3145,903,163,335,858,191,817
5,264,473 to the power 4768,103,263,996,215,382,649,417,441
5,264,473 to the power 54,043,658,894,519,947,984,142,526,583,873,593
First ten multiples5,264,473, 10,528,946, 15,793,419, 21,057,892, 26,322,365, 31,586,838, 36,851,311, 42,115,784, 47,380,257, 52,644,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Highest value reached17,767,6003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,264,473 → 15,793,420 → 7,896,710 → 3,948,355 → 11,845,066 → 5,922,533 → 17,767,600 → 8,883,800 → 4,441,900 → 2,220,950 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage526,447,300%
5,264,473% as a decimal52,644.73
5,264,473% of 1005,264,473
5,264,473% of 1,00052,644,730
As a fraction of 1005,264,473/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,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page