Recognised as Number
1,237,151
- Positive
- Odd
- Prime
- 7 digits
1,237,151 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 value1,237,151
Digit count7
Digit sum20
Digit product210
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 factorisation1,237,151
Distinct prime factors11,237,151
Number of divisors2
Sum of divisors σ(n)1,237,152
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,237,150integers below n that share no factor with it
Carmichael function λ(n)1,237,150the 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,1512 in total
Arithmetic
Previous number1,237,150
Next number1,237,152
Double2,474,302
Half618,575.5
Square1,530,542,596,801
Cube1,893,512,304,174,953,951
Square root1,112.272898168≈irrational, shown to 9 decimal places
Cube root107.351364802≈
Negation-1,237,151
Reciprocal8.08308767 × 10^-7≈
Representations
Decimal1,237,151
Binary10010111000001001111121 bits
Octal4560237
Hexadecimal12E09F
Base 36QILB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-seven thousand, one hundred and fifty-one
Ordinalone million, two hundred and thirty-seven thousand, one hundred and fifty-first
Scientific notation1.237151 × 10^6
Engineering notation1.237151 × 10^6
In other bases
Ternary2022212001102base 3; the most digit-efficient integer base after e: 13 digits
Quinary304042101base 5; one hand: 9 digits
Septenary13341566base 7: 8 digits
Nonary2285042base 9; each digit is two ternary digits: 7 digits
Duodecimal4b7b3bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7echbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:43:39:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1000TT00111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010000111100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101110000010011111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 9f
Gray code110111001000011010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101110000010011111
64-bit0000000000000000000000000000000000000000000100101110000010011111
One's complement11111111111011010001111101100000at 32 bits, every bit flipped
Bits reversed11111001000001110100100000000000at 32 bits
Rotated left by 100000000001001011100000100111110at 32 bits, wrapping
Shifted left by 11001011100000100111110= 2,474,302, no wrap
Shifted right by 110010111000001001111= 618,575, discarding the low bit
These bits as a double6.11233808 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,237,151 to the power 21,530,542,596,801
1,237,151 to the power 31,893,512,304,174,953,951
1,237,151 to the power 42,342,560,640,622,348,455,433,601
1,237,151 to the power 52,898,101,239,106,579,013,988,134,910,751
First ten multiples1,237,151, 2,474,302, 3,711,453, 4,948,604, 6,185,755, 7,422,906, 8,660,057, 9,897,208, 11,134,359, 12,371,510
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 1204the total stopping time
Highest value reached71,340,42457× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,237,151 → 3,711,454 → 1,855,727 → 5,567,182 → 2,783,591 → 8,350,774 → 4,175,387 → 12,526,162 → 6,263,081 → 18,789,244 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,715,100%
1,237,151% as a decimal12,371.51
1,237,151% of 1001,237,151
1,237,151% of 1,00012,371,510
As a fraction of 1001,237,151/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,151
Nerdulate something else
Nothing in mind? Surprise me · today’s page