Recognised as Number
1,275,359
- Positive
- Odd
- Prime
- 7 digits
1,275,359 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,275,359
Digit count7
Digit sum32
Digit product9,450
Multiplicative persistence2times 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,275,359
Distinct prime factors11,275,359
Number of divisors2
Sum of divisors σ(n)1,275,360
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,275,358integers below n that share no factor with it
Carmichael function λ(n)1,275,358the 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,275,3592 in total
Arithmetic
Previous number1,275,358
Next number1,275,360
Double2,550,718
Half637,679.5
Square1,626,540,578,881
Cube2,074,423,166,141,093,279
Square root1,129.317935747≈irrational, shown to 9 decimal places
Cube root108.445320619≈
Negation-1,275,359
Reciprocal7.8409295 × 10^-7≈
Representations
Decimal1,275,359
Binary10011011101011101111121 bits
Octal4672737
Hexadecimal1375DF
Base 36RC2N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and seventy-five thousand, three hundred and fifty-nine
Ordinalone million, two hundred and seventy-five thousand, three hundred and fifty-ninth
Scientific notation1.275359 × 10^6
Engineering notation1.275359 × 10^6
In other bases
Ternary2101210110112base 3; the most digit-efficient integer base after e: 13 digits
Quinary311302414base 5; one hand: 9 digits
Septenary13561151base 7: 8 digits
Nonary2353415base 9; each digit is two ternary digits: 7 digits
Duodecimal51607bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7j87jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:54:15:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TT10111TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001000101000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110111010111011111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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 75 df
Gray code110101100111100110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110111010111011111
64-bit0000000000000000000000000000000000000000000100110111010111011111
One's complement11111111111011001000101000100000at 32 bits, every bit flipped
Bits reversed11111011101011101100100000000000at 32 bits
Rotated left by 100000000001001101110101110111110at 32 bits, wrapping
Shifted left by 11001101110101110111110= 2,550,718, no wrap
Shifted right by 110011011101011101111= 637,679, discarding the low bit
These bits as a double6.30111068 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,275,359 to the power 21,626,540,578,881
1,275,359 to the power 32,074,423,166,141,093,279
1,275,359 to the power 42,645,634,254,746,538,583,212,161
1,275,359 to the power 53,374,133,457,499,290,700,946,878,440,799
First ten multiples1,275,359, 2,550,718, 3,826,077, 5,101,436, 6,376,795, 7,652,154, 8,927,513, 10,202,872, 11,478,231, 12,753,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1124the total stopping time
Highest value reached19,369,52815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,275,359 → 3,826,078 → 1,913,039 → 5,739,118 → 2,869,559 → 8,608,678 → 4,304,339 → 12,913,018 → 6,456,509 → 19,369,528 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage127,535,900%
1,275,359% as a decimal12,753.59
1,275,359% of 1001,275,359
1,275,359% of 1,00012,753,590
As a fraction of 1001,275,359/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,275,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page