Recognised as Number

1,292,009

Positive
Odd
Prime
7 digits

1,292,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 value1,292,009

Digit count7

Digit sum23

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 factorisation1,292,009

Distinct prime factors11,292,009

Number of divisors2

Sum of divisors σ(n)1,292,010

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,292,008integers below n that share no factor with it

Carmichael function λ(n)1,292,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, 1,292,0092 in total

Arithmetic

Previous number1,292,008

Next number1,292,010

Double2,584,018

Half646,004.5

Square1,669,287,256,081

Cube2,156,734,158,441,956,729

Square root1,136.665738025≈irrational, shown to 9 decimal places

Cube root108.915204933≈

Negation-1,292,009

Reciprocal7.73988416 × 10^-7≈

Representations

Decimal1,292,009

Binary10011101101101110100121 bits

Octal4733351

Hexadecimal13B6E9

Base 36ROX5

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, two hundred and ninety-two thousand and nine

Ordinalone million, two hundred and ninety-two thousand and ninth

Scientific notation1.292009 × 10^6

Engineering notation1.292009 × 10^6

In other bases

Ternary2102122022012base 3; the most digit-efficient integer base after e: 13 digits

Quinary312321014base 5; one hand: 9 digits

Septenary13660535base 7: 8 digits

Nonary2378265base 9; each digit is two ternary digits: 7 digits

Duodecimal523835base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal81a09base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:58:53:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T110T0T10T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101001100101100111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100111011011011101001

Bit length21 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits8within that length

Bit parityodd13 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes313 b6 e9

Gray code110100110110110011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100111011011011101001

64-bit0000000000000000000000000000000000000000000100111011011011101001

One's complement11111111111011000100100100010110at 32 bits, every bit flipped

Bits reversed10010111011011011100100000000000at 32 bits

Rotated left by 100000000001001110110110111010010at 32 bits, wrapping

Shifted left by 11001110110110111010010= 2,584,018, no wrap

Shifted right by 110011101101101110100= 646,004, discarding the low bit

These bits as a double6.38337261 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,292,023+14

Previous prime1,291,999−10

Distance to nearest prime0, it is prime

Nearest square below1,290,496

Nearest square above1,292,769

Powers & multiples

1,292,009 to the power 21,669,287,256,081

1,292,009 to the power 32,156,734,158,441,956,729

1,292,009 to the power 42,786,519,943,314,434,071,478,561

1,292,009 to the power 53,600,208,845,441,738,650,256,944,119,049

First ten multiples1,292,009, 2,584,018, 3,876,027, 5,168,036, 6,460,045, 7,752,054, 9,044,063, 10,336,072, 11,628,081, 12,920,090

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

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 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached9,811,2047× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,292,009 → 3,876,028 → 1,938,014 → 969,007 → 2,907,022 → 1,453,511 → 4,360,534 → 2,180,267 → 6,540,802 → 3,270,401 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage129,200,900%

1,292,009% as a decimal12,920.09

1,292,009% of 1001,292,009

1,292,009% of 1,00012,920,090

As a fraction of 1001,292,009/100

Read another way

As seconds14 days, 22 hours and 53 minutes

As bytes1.232 MiB

As a 24-bit colour#13B6E9

Keep nerding

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