Recognised as Number
1,264,129
- Positive
- Odd
- Prime
- 7 digits
1,264,129 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,264,129
Digit count7
Digit sum25
Digit product864
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,264,129
Distinct prime factors11,264,129
Number of divisors2
Sum of divisors σ(n)1,264,130
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,264,128integers below n that share no factor with it
Carmichael function λ(n)1,264,128the 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,264,1292 in total
Arithmetic
Previous number1,264,128
Next number1,264,130
Double2,528,258
Half632,064.5
Square1,598,022,128,641
Cube2,020,106,115,456,818,689
Square root1,124.334914516≈irrational, shown to 9 decimal places
Cube root108.126081605≈
Negation-1,264,129
Reciprocal7.91058507 × 10^-7≈
Representations
Decimal1,264,129
Binary10011010010100000000121 bits
Octal4645001
Hexadecimal134A01
Base 36R3EP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-four thousand, one hundred and twenty-nine
Ordinalone million, two hundred and sixty-four thousand, one hundred and twenty-ninth
Scientific notation1.264129 × 10^6
Engineering notation1.264129 × 10^6
In other bases
Ternary2101020001121base 3; the most digit-efficient integer base after e: 13 digits
Quinary310423004base 5; one hand: 9 digits
Septenary13513336base 7: 8 digits
Nonary2336047base 9; each digit is two ternary digits: 7 digits
Duodecimal50b681base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7i069base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:51:8:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1011T001TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101111000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110100101000000001
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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 4a 01
Gray code110101110111100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110100101000000001
64-bit0000000000000000000000000000000000000000000100110100101000000001
One's complement11111111111011001011010111111110at 32 bits, every bit flipped
Bits reversed10000000010100101100100000000000at 32 bits
Rotated left by 100000000001001101001010000000010at 32 bits, wrapping
Shifted left by 11001101001010000000010= 2,528,258, no wrap
Shifted right by 110011010010100000000= 632,064, discarding the low bit
These bits as a double6.24562711 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,264,129 to the power 21,598,022,128,641
1,264,129 to the power 32,020,106,115,456,818,689
1,264,129 to the power 42,553,674,723,626,312,752,506,881
1,264,129 to the power 53,228,174,274,703,007,113,513,770,971,649
First ten multiples1,264,129, 2,528,258, 3,792,387, 5,056,516, 6,320,645, 7,584,774, 8,848,903, 10,113,032, 11,377,161, 12,641,290
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 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 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached3,792,3883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,264,129 → 3,792,388 → 1,896,194 → 948,097 → 2,844,292 → 1,422,146 → 711,073 → 2,133,220 → 1,066,610 → 533,305 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,412,900%
1,264,129% as a decimal12,641.29
1,264,129% of 1001,264,129
1,264,129% of 1,00012,641,290
As a fraction of 1001,264,129/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 1,264,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page