Recognised as Number
1,237,139
- Positive
- Odd
- Prime
- 7 digits
1,237,139 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,237,139
Digit count7
Digit sum26
Digit product1,134
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,237,139
Distinct prime factors11,237,139
Number of divisors2
Sum of divisors σ(n)1,237,140
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,237,138integers below n that share no factor with it
Carmichael function λ(n)1,237,138the 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,237,1392 in total
Arithmetic
Previous number1,237,138
Next number1,237,140
Double2,474,278
Half618,569.5
Square1,530,512,905,321
Cube1,893,457,205,175,916,619
Square root1,112.267503796≈irrational, shown to 9 decimal places
Cube root107.351017709≈
Negation-1,237,139
Reciprocal8.08316608 × 10^-7≈
Representations
Decimal1,237,139
Binary10010111000001001001121 bits
Octal4560223
Hexadecimal12E093
Base 36QIKZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-seven thousand, one hundred and thirty-nine
Ordinalone million, two hundred and thirty-seven thousand, one hundred and thirty-ninth
Scientific notation1.237139 × 10^6
Engineering notation1.237139 × 10^6
In other bases
Ternary2022212000222base 3; the most digit-efficient integer base after e: 13 digits
Quinary304042024base 5; one hand: 9 digits
Septenary13341551base 7: 8 digits
Nonary2285028base 9; each digit is two ternary digits: 7 digits
Duodecimal4b7b2bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7ecgjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:43:38:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1000TT00100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010000110010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101110000010010011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes312 e0 93
Gray code110111001000011011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101110000010010011
64-bit0000000000000000000000000000000000000000000100101110000010010011
One's complement11111111111011010001111101101100at 32 bits, every bit flipped
Bits reversed11001001000001110100100000000000at 32 bits
Rotated left by 100000000001001011100000100100110at 32 bits, wrapping
Shifted left by 11001011100000100100110= 2,474,278, no wrap
Shifted right by 110010111000001001001= 618,569, discarding the low bit
These bits as a double6.11227879 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,237,139 to the power 21,530,512,905,321
1,237,139 to the power 31,893,457,205,175,916,619
1,237,139 to the power 42,342,469,753,354,128,310,113,041
1,237,139 to the power 52,897,960,688,194,772,943,444,937,429,699
First ten multiples1,237,139, 2,474,278, 3,711,417, 4,948,556, 6,185,695, 7,422,834, 8,659,973, 9,897,112, 11,134,251, 12,371,390
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 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1235the total stopping time
Highest value reached5,567,1284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,237,139 → 3,711,418 → 1,855,709 → 5,567,128 → 2,783,564 → 1,391,782 → 695,891 → 2,087,674 → 1,043,837 → 3,131,512 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,713,900%
1,237,139% as a decimal12,371.39
1,237,139% of 1001,237,139
1,237,139% of 1,00012,371,390
As a fraction of 1001,237,139/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,237,139
Nerdulate something else
Nothing in mind? Surprise me · today’s page