Recognised as Number
5,136,520
- Positive
- Even
- Composite
- 7 digits
5,136,520 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,136,520
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 5 × 128,413
Distinct prime factors32, 5, 128,413
Number of divisors16
Sum of divisors σ(n)11,557,260
Aliquot sum6,420,740sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,054,592integers below n that share no factor with it
Carmichael function λ(n)128,412the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,054,592
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 20, 40, 128,413, 256,826, 513,652, 642,065, 1,027,304, 1,284,130, 2,568,260, 5,136,52016 in total
Arithmetic
Previous number5,136,519
Next number5,136,521
Double10,273,040
Half2,568,260
Square26,383,837,710,400
Cube135,521,110,076,223,808,000
Square root2,266.389198704≈irrational, shown to 9 decimal places
Cube root172.53994734≈
Negation-5,136,520
Reciprocal1.94684339 × 10^-7≈
Representations
Decimal5,136,520
Binary1001110011000001000100023 bits
Octal23460210
Hexadecimal4E6088
Base 36323D4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and thirty-six thousand, five hundred and twenty
Ordinalfive million, one hundred and thirty-six thousand, five hundred and twentieth
Scientific notation5.13652 × 10^6
Engineering notation5.13652 × 10^6
In other bases
Ternary100122221222111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2303332040base 5; one hand: 10 digits
Septenary61442164base 7: 8 digits
Nonary10587874base 9; each digit is two ternary digits: 8 digits
Duodecimal1878634base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c2160base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:46:48:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T0000T00T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111010000110011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011100110000010001000
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes34e 60 88
Gray code11010010101000011001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011100110000010001000
64-bit0000000000000000000000000000000000000000010011100110000010001000
One's complement11111111101100011001111101110111at 32 bits, every bit flipped
Bits reversed00010001000001100111001000000000at 32 bits
Rotated left by 100000000100111001100000100010000at 32 bits, wrapping
Shifted left by 1100111001100000100010000= 10,273,040, no wrap
Shifted right by 11001110011000001000100= 2,568,260, discarding the low bit
These bits as a double2.53777807 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,136,520 to the power 226,383,837,710,400
5,136,520 to the power 3135,521,110,076,223,808,000
5,136,520 to the power 4696,106,892,328,725,114,268,160,000
5,136,520 to the power 53,575,566,974,584,343,123,940,689,203,200,000
First ten multiples5,136,520, 10,273,040, 15,409,560, 20,546,080, 25,682,600, 30,819,120, 35,955,640, 41,092,160, 46,228,680, 51,365,200
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 156the total stopping time
Highest value reached5,136,520
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,136,520 → 2,568,260 → 1,284,130 → 642,065 → 1,926,196 → 963,098 → 481,549 → 1,444,648 → 722,324 → 361,162 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage513,652,000%
5,136,520% as a decimal51,365.2
5,136,520% of 1005,136,520
5,136,520% of 1,00051,365,200
As a fraction of 1005,136,520/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,136,520
Nerdulate something else
Nothing in mind? Surprise me · today’s page