Recognised as Number
5,327,449
- Positive
- Odd
- Prime
- 7 digits
5,327,449 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,327,449
Digit count7
Digit sum34
Digit product30,240
Multiplicative persistence2times 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,327,449
Distinct prime factors15,327,449
Number of divisors2
Sum of divisors σ(n)5,327,450
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,327,448integers below n that share no factor with it
Carmichael function λ(n)5,327,448the 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,327,4492 in total
Arithmetic
Previous number5,327,448
Next number5,327,450
Double10,654,898
Half2,663,724.5
Square28,381,712,847,601
Cube151,202,127,728,239,099,849
Square root2,308.126729623≈irrational, shown to 9 decimal places
Cube root174.651813818≈
Negation-5,327,449
Reciprocal1.877071 × 10^-7≈
Representations
Decimal5,327,449
Binary1010001010010100101100123 bits
Octal24245131
Hexadecimal514A59
Base 36366OP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and twenty-seven thousand, four hundred and forty-nine
Ordinalfive million, three hundred and twenty-seven thousand, four hundred and forty-ninth
Scientific notation5.327449 × 10^6
Engineering notation5.327449 × 10^6
In other bases
Ternary101000122212221base 3; the most digit-efficient integer base after e: 15 digits
Quinary2330434244base 5; one hand: 10 digits
Septenary63165631base 7: 8 digits
Nonary11018787base 9; each digit is two ternary digits: 8 digits
Duodecimal194b021base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1d5ic9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:39:50:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101001T000T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010101111110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100010100101001011001
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
Bytes351 4a 59
Gray code11110011110111101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100010100101001011001
64-bit0000000000000000000000000000000000000000010100010100101001011001
One's complement11111111101011101011010110100110at 32 bits, every bit flipped
Bits reversed10011010010100101000101000000000at 32 bits
Rotated left by 100000000101000101001010010110010at 32 bits, wrapping
Shifted left by 1101000101001010010110010= 10,654,898, no wrap
Shifted right by 11010001010010100101100= 2,663,724, discarding the low bit
These bits as a double2.63210953 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,327,449 to the power 228,381,712,847,601
5,327,449 to the power 3151,202,127,728,239,099,849
5,327,449 to the power 4805,521,624,163,679,664,251,455,201
5,327,449 to the power 54,291,375,371,129,171,063,636,750,759,112,249
First ten multiples5,327,449, 10,654,898, 15,982,347, 21,309,796, 26,637,245, 31,964,694, 37,292,143, 42,619,592, 47,947,041, 53,274,490
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 182the total stopping time
Highest value reached17,980,1443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,327,449 → 15,982,348 → 7,991,174 → 3,995,587 → 11,986,762 → 5,993,381 → 17,980,144 → 8,990,072 → 4,495,036 → 2,247,518 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage532,744,900%
5,327,449% as a decimal53,274.49
5,327,449% of 1005,327,449
5,327,449% of 1,00053,274,490
As a fraction of 1005,327,449/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,327,449
Nerdulate something else
Nothing in mind? Surprise me · today’s page