Recognised as Number
5,390,521
- Positive
- Odd
- Prime
- 7 digits
5,390,521 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 value5,390,521
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,390,521
Distinct prime factors15,390,521
Number of divisors2
Sum of divisors σ(n)5,390,522
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,390,520integers below n that share no factor with it
Carmichael function λ(n)5,390,520the 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,390,5212 in total
Arithmetic
Previous number5,390,520
Next number5,390,522
Double10,781,042
Half2,695,260.5
Square29,057,716,651,441
Cube156,636,231,821,642,390,761
Square root2,321.749555831≈irrational, shown to 9 decimal places
Cube root175.338349486≈
Negation-5,390,521
Reciprocal1.85510825 × 10^-7≈
Representations
Decimal5,390,521
Binary1010010010000001011100123 bits
Octal24440271
Hexadecimal5240B9
Base 3637JCP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and ninety thousand, five hundred and twenty-one
Ordinalfive million, three hundred and ninety thousand, five hundred and twenty-first
Scientific notation5.390521 × 10^6
Engineering notation5.390521 × 10^6
In other bases
Ternary101010212101221base 3; the most digit-efficient integer base after e: 15 digits
Quinary2334444041base 5; one hand: 10 digits
Septenary63550543base 7: 8 digits
Nonary11125357base 9; each digit is two ternary digits: 8 digits
Duodecimal197b621base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ddg61base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:57:22:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010110TT11T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100100000111001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100100000010111001
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
Bytes352 40 b9
Gray code11110110110000011100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100100000010111001
64-bit0000000000000000000000000000000000000000010100100100000010111001
One's complement11111111101011011011111101000110at 32 bits, every bit flipped
Bits reversed10011101000000100100101000000000at 32 bits
Rotated left by 100000000101001001000000101110010at 32 bits, wrapping
Shifted left by 1101001001000000101110010= 10,781,042, no wrap
Shifted right by 11010010010000001011100= 2,695,260, discarding the low bit
These bits as a double2.66327124 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,390,521 to the power 229,057,716,651,441
5,390,521 to the power 3156,636,231,821,642,390,761
5,390,521 to the power 4844,350,896,995,431,561,887,376,481
5,390,521 to the power 54,551,491,241,622,710,738,416,702,555,736,601
First ten multiples5,390,521, 10,781,042, 16,171,563, 21,562,084, 26,952,605, 32,343,126, 37,733,647, 43,124,168, 48,514,689, 53,905,210
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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 187the total stopping time
Highest value reached18,193,0123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,390,521 → 16,171,564 → 8,085,782 → 4,042,891 → 12,128,674 → 6,064,337 → 18,193,012 → 9,096,506 → 4,548,253 → 13,644,760 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage539,052,100%
5,390,521% as a decimal53,905.21
5,390,521% of 1005,390,521
5,390,521% of 1,00053,905,210
As a fraction of 1005,390,521/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,390,521
Nerdulate something else
Nothing in mind? Surprise me · today’s page