Nerdulator> put something in

Recognised as Number

5,136,529

  • Positive
  • Odd
  • Prime
  • 7 digits

5,136,529 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,136,529
Digit count7
Digit sum31
Digit product8,100
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5,136,529
Distinct prime factors15,136,529
Number of divisors2
Sum of divisors σ(n)5,136,530
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,136,528integers below n that share no factor with it
Carmichael function λ(n)5,136,528the 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,136,5292 in total

Arithmetic

Previous number5,136,528
Next number5,136,530
Cube135,521,822,441,090,163,889
Square root2,266.39118424≈irrational, shown to 9 decimal places
Cube root172.540048112≈
Negation-5,136,529
Reciprocal1.94683998 × 10^-7≈

Representations

Decimal5,136,529
Binary1001110011000001001000123 bits
Octal23460221
Hexadecimal4E6091
Base 36323DD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and thirty-six thousand, five hundred and twenty-nine
Ordinalfive million, one hundred and thirty-six thousand, five hundred and twenty-ninth
Scientific notation5.136529 × 10^6
Engineering notation5.136529 × 10^6

In other bases

Ternary100122221222211base 3; the most digit-efficient integer base after e: 15 digits
Quinary2303332104base 5; one hand: 10 digits
Septenary61442206base 7: 8 digits
Nonary10587884base 9; each digit is two ternary digits: 8 digits
Duodecimal1878641base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1c2169base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:46:48:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T0000T000T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100111010000110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010011100110000010010001
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
Bytes34e 60 91
Gray code11010010101000011011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010011100110000010010001
64-bit0000000000000000000000000000000000000000010011100110000010010001
One's complement11111111101100011001111101101110at 32 bits, every bit flipped
Bits reversed10001001000001100111001000000000at 32 bits
Rotated left by 100000000100111001100000100100010at 32 bits, wrapping
Shifted left by 1100111001100000100100010= 10,273,058, no wrap
Shifted right by 11001110011000001001000= 2,568,264, discarding the low bit
These bits as a double2.53778252 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,136,553+24
Previous prime5,136,511−18
Distance to nearest prime0, it is prime
Nearest square below5,134,756
Nearest square above5,139,289

Powers & multiples

5,136,529 to the power 226,383,930,167,841
5,136,529 to the power 3135,521,822,441,090,163,889
5,136,529 to the power 4696,111,771,101,510,418,430,601,281
5,136,529 to the power 53,575,598,299,504,270,208,070,917,967,293,649
First ten multiples5,136,529, 10,273,058, 15,409,587, 20,546,116, 25,682,645, 30,819,174, 35,955,703, 41,092,232, 46,228,761, 51,365,290
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1126the total stopping time
Highest value reached16,455,4723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,136,529 → 15,409,588 → 7,704,794 → 3,852,397 → 11,557,192 → 5,778,596 → 2,889,298 → 1,444,649 → 4,333,948 → 2,166,974 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage513,652,900%
5,136,529% as a decimal51,365.29
5,136,529% of 1005,136,529
5,136,529% of 1,00051,365,290
As a fraction of 1005,136,529/100

Read another way

As bytes4.899 MiB
As a 24-bit colour#4E6091

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “5136529” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.