Recognised as Number
5,396,009
- Positive
- Odd
- Prime
- 7 digits
5,396,009 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,396,009
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,396,009
Distinct prime factors15,396,009
Number of divisors2
Sum of divisors σ(n)5,396,010
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,396,008integers below n that share no factor with it
Carmichael function λ(n)5,396,008the 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,396,0092 in total
Arithmetic
Previous number5,396,008
Next number5,396,010
Double10,792,018
Half2,698,004.5
Square29,116,913,128,081
Cube157,115,125,291,343,228,729
Square root2,322.931122526≈irrational, shown to 9 decimal places
Cube root175.397832326≈
Negation-5,396,009
Reciprocal1.85322152 × 10^-7≈
Representations
Decimal5,396,009
Binary1010010010101100010100123 bits
Octal24453051
Hexadecimal525629
Base 3637NL5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and ninety-six thousand and nine
Ordinalfive million, three hundred and ninety-six thousand and ninth
Scientific notation5.396009 × 10^6
Engineering notation5.396009 × 10^6
In other bases
Ternary101011010221012base 3; the most digit-efficient integer base after e: 15 digits
Quinary2340133014base 5; one hand: 10 digits
Septenary63602543base 7: 8 digits
Nonary11133835base 9; each digit is two ternary digits: 8 digits
Duodecimal1982835base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1dea09base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:58:53:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010110110T11TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111010101001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100101011000101001
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
Bytes352 56 29
Gray code11110110111110100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100101011000101001
64-bit0000000000000000000000000000000000000000010100100101011000101001
One's complement11111111101011011010100111010110at 32 bits, every bit flipped
Bits reversed10010100011010100100101000000000at 32 bits
Rotated left by 100000000101001001010110001010010at 32 bits, wrapping
Shifted left by 1101001001010110001010010= 10,792,018, no wrap
Shifted right by 11010010010101100010100= 2,698,004, discarding the low bit
These bits as a double2.66598267 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,396,009 to the power 229,116,913,128,081
5,396,009 to the power 3157,115,125,291,343,228,729
5,396,009 to the power 4847,794,630,108,215,684,310,742,561
5,396,009 to the power 54,574,707,454,215,602,806,481,925,655,839,049
First ten multiples5,396,009, 10,792,018, 16,188,027, 21,584,036, 26,980,045, 32,376,054, 37,772,063, 43,168,072, 48,564,081, 53,960,090
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1126the total stopping time
Highest value reached233,370,88043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,396,009 → 16,188,028 → 8,094,014 → 4,047,007 → 12,141,022 → 6,070,511 → 18,211,534 → 9,105,767 → 27,317,302 → 13,658,651 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage539,600,900%
5,396,009% as a decimal53,960.09
5,396,009% of 1005,396,009
5,396,009% of 1,00053,960,090
As a fraction of 1005,396,009/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,396,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page