Nerdulator> put something in

Recognised as Number

5,264,489

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,264,489
Digit count7
Digit sum38
Digit product69,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number5,264,488
Next number5,264,490
Cube145,904,493,644,347,762,169
Square root2,294.447428031≈irrational, shown to 9 decimal places
Cube root173.961071575≈
Negation-5,264,489
Reciprocal1.89951959 × 10^-7≈

Representations

Decimal5,264,489
Binary1010000010101000110100123 bits
Octal24052151
Hexadecimal505469
Base 3634U3T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, two hundred and sixty-four thousand, four hundred and eighty-nine
Ordinalfive million, two hundred and sixty-four thousand, four hundred and eighty-ninth
Scientific notation5.264489 × 10^6
Engineering notation5.264489 × 10^6

In other bases

Ternary100220110112002base 3; the most digit-efficient integer base after e: 15 digits
Quinary2321430424base 5; one hand: 10 digits
Septenary62514236base 7: 8 digits
Nonary10813462base 9; each digit is two ternary digits: 8 digits
Duodecimal191a6b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ci149base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:22:21:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010T0111TTT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100000101010110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010100000101010001101001
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
Bytes350 54 69
Gray code11110000111111001011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010100000101010001101001
64-bit0000000000000000000000000000000000000000010100000101010001101001
One's complement11111111101011111010101110010110at 32 bits, every bit flipped
Bits reversed10010110001010100000101000000000at 32 bits
Rotated left by 100000000101000001010100011010010at 32 bits, wrapping
Shifted left by 1101000001010100011010010= 10,528,978, no wrap
Shifted right by 11010000010101000110100= 2,632,244, discarding the low bit
These bits as a double2.60100316 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,264,521+32
Previous prime5,264,477−12
Distance to nearest prime0, it is prime
Nearest square below5,262,436
Nearest square above5,267,025

Powers & multiples

5,264,489 to the power 227,714,844,431,121
5,264,489 to the power 3145,904,493,644,347,762,169
5,264,489 to the power 4768,112,601,841,238,706,113,316,641
5,264,489 to the power 54,043,720,343,154,580,914,707,788,210,061,449
First ten multiples5,264,489, 10,528,978, 15,793,467, 21,057,956, 26,322,445, 31,586,934, 36,851,423, 42,115,912, 47,380,401, 52,644,890
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1175the total stopping time
Highest value reached39,977,2247× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,264,489 → 15,793,468 → 7,896,734 → 3,948,367 → 11,845,102 → 5,922,551 → 17,767,654 → 8,883,827 → 26,651,482 → 13,325,741 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage526,448,900%
5,264,489% as a decimal52,644.89
5,264,489% of 1005,264,489
5,264,489% of 1,00052,644,890
As a fraction of 1005,264,489/100

Read another way

As bytes5.021 MiB
As a 24-bit colour#505469

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 “5264489” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.