Recognised as Number
5,133,664
- Positive
- Even
- Composite
- 7 digits
5,133,664 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,133,664
Digit count7
Digit sum28
Digit product6,480
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 factorisation2^5 × 137 × 1,171
Distinct prime factors32, 137, 1,171
Number of divisors24
Sum of divisors σ(n)10,189,368
Aliquot sum5,055,704sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,545,920integers below n that share no factor with it
Carmichael function λ(n)79,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,545,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 137, 274, 548, 1,096, 1,171, 2,192, 2,342, 4,384, 4,684, 9,368, 18,736, 37,472, 160,427, 320,854, 641,708, 1,283,416, 2,566,832, 5,133,66424 in total
Arithmetic
Previous number5,133,663
Next number5,133,665
Double10,267,328
Half2,566,832
Square26,354,506,064,896
Cube135,295,179,023,138,258,944
Square root2,265.759033966≈irrational, shown to 9 decimal places
Cube root172.507962945≈
Negation-5,133,664
Reciprocal1.94792647 × 10^-7≈
Representations
Decimal5,133,664
Binary1001110010101010110000023 bits
Octal23452540
Hexadecimal4E5560
Base 363215S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and thirty-three thousand, six hundred and sixty-four
Ordinalfive million, one hundred and thirty-three thousand, six hundred and sixty-fourth
Scientific notation5.133664 × 10^6
Engineering notation5.133664 × 10^6
In other bases
Ternary100122211001201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2303234124base 5; one hand: 10 digits
Septenary61430644base 7: 8 digits
Nonary10584051base 9; each digit is two ternary digits: 8 digits
Duodecimal1876a54base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c1e34base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:46:1:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T00T1101TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111010101010100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011100101010101100000
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 even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes34e 55 60
Gray code11010010111111111010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011100101010101100000
64-bit0000000000000000000000000000000000000000010011100101010101100000
One's complement11111111101100011010101010011111at 32 bits, every bit flipped
Bits reversed00000110101010100111001000000000at 32 bits
Rotated left by 100000000100111001010101011000000at 32 bits, wrapping
Shifted left by 1100111001010101011000000= 10,267,328, no wrap
Shifted right by 11001110010101010110000= 2,566,832, discarding the low bit
These bits as a double2.53636702 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,133,664 to the power 226,354,506,064,896
5,133,664 to the power 3135,295,179,023,138,258,944
5,133,664 to the power 4694,559,989,924,640,046,963,490,816
5,133,664 to the power 53,565,637,616,116,487,322,054,782,116,429,824
First ten multiples5,133,664, 10,267,328, 15,400,992, 20,534,656, 25,668,320, 30,801,984, 35,935,648, 41,069,312, 46,202,976, 51,336,640
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 8
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1113the total stopping time
Highest value reached5,133,664
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,133,664 → 2,566,832 → 1,283,416 → 641,708 → 320,854 → 160,427 → 481,282 → 240,641 → 721,924 → 360,962 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage513,366,400%
5,133,664% as a decimal51,336.64
5,133,664% of 1005,133,664
5,133,664% of 1,00051,336,640
As a fraction of 1005,133,664/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,133,664
Nerdulate something else
Nothing in mind? Surprise me · today’s page