Recognised as Number
5,352,481
- Positive
- Odd
- Prime
- 7 digits
5,352,481 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,352,481
Digit count7
Digit sum28
Digit product4,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,352,481
Distinct prime factors15,352,481
Number of divisors2
Sum of divisors σ(n)5,352,482
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,352,480integers below n that share no factor with it
Carmichael function λ(n)5,352,480the 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,352,4812 in total
Arithmetic
Previous number5,352,480
Next number5,352,482
Double10,704,962
Half2,676,240.5
Square28,649,052,855,361
Cube153,343,511,076,315,500,641
Square root2,313.542953999≈irrational, shown to 9 decimal places
Cube root174.924931068≈
Negation-5,352,481
Reciprocal1.86829248 × 10^-7≈
Representations
Decimal5,352,481
Binary1010001101011000010000123 bits
Octal24326041
Hexadecimal51AC21
Base 3636Q01
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and fifty-two thousand, four hundred and eighty-one
Ordinalfive million, three hundred and fifty-two thousand, four hundred and eighty-first
Scientific notation5.352481 × 10^6
Engineering notation5.352481 × 10^6
In other bases
Ternary101001221020001base 3; the most digit-efficient integer base after e: 15 digits
Quinary2332234411base 5; one hand: 10 digits
Septenary63331621base 7: 8 digits
Nonary11057201base 9; each digit is two ternary digits: 8 digits
Duodecimal1961601base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1d9141base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:46:48:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10101T0T11T0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101101111110001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100011010110000100001
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
Bytes351 ac 21
Gray code11110010111101000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100011010110000100001
64-bit0000000000000000000000000000000000000000010100011010110000100001
One's complement11111111101011100101001111011110at 32 bits, every bit flipped
Bits reversed10000100001101011000101000000000at 32 bits
Rotated left by 100000000101000110101100001000010at 32 bits, wrapping
Shifted left by 1101000110101100001000010= 10,704,962, no wrap
Shifted right by 11010001101011000010000= 2,676,240, discarding the low bit
These bits as a double2.64447698 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,352,481 to the power 228,649,052,855,361
5,352,481 to the power 3153,343,511,076,315,500,641
5,352,481 to the power 4820,768,229,509,268,267,186,440,321
5,352,481 to the power 54,393,146,353,851,997,724,018,345,275,786,401
First ten multiples5,352,481, 10,704,962, 16,057,443, 21,409,924, 26,762,405, 32,114,886, 37,467,367, 42,819,848, 48,172,329, 53,524,810
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1139the total stopping time
Highest value reached16,057,4443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,352,481 → 16,057,444 → 8,028,722 → 4,014,361 → 12,043,084 → 6,021,542 → 3,010,771 → 9,032,314 → 4,516,157 → 13,548,472 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage535,248,100%
5,352,481% as a decimal53,524.81
5,352,481% of 1005,352,481
5,352,481% of 1,00053,524,810
As a fraction of 1005,352,481/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,352,481
Nerdulate something else
Nothing in mind? Surprise me · today’s page