Recognised as Number

1,237,141

Positive
Odd
Composite
7 digits

1,237,141 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,237,141

Digit count7

Digit sum19

Digit product168

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 61 × 1,193

Distinct prime factors317, 61, 1,193

Number of divisors8

Sum of divisors σ(n)1,332,504

Aliquot sum95,363sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)35,760the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,144,320

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 17, 61, 1,037, 1,193, 20,281, 72,773, 1,237,1418 in total

Arithmetic

Previous number1,237,140

Next number1,237,142

Double2,474,282

Half618,570.5

Square1,530,517,853,881

Cube1,893,466,388,268,194,221

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

Cube root107.351075558≈

Negation-1,237,141

Reciprocal8.08315301 × 10^-7≈

Representations

Decimal1,237,141

Binary10010111000001001010121 bits

Octal4560225

Hexadecimal12E095

Base 36QIL1

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

In wordsone million, two hundred and thirty-seven thousand, one hundred and forty-one

Ordinalone million, two hundred and thirty-seven thousand, one hundred and forty-first

Scientific notation1.237141 × 10^6

Engineering notation1.237141 × 10^6

In other bases

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

Quinary304042031base 5; one hand: 9 digits

Septenary13341553base 7: 8 digits

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

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

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

Sexagesimal5:43:39:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100101110000010010101

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 95

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

At each machine width

32-bit00000000000100101110000010010101

64-bit0000000000000000000000000000000000000000000100101110000010010101

One's complement11111111111011010001111101101010at 32 bits, every bit flipped

Bits reversed10101001000001110100100000000000at 32 bits

Rotated left by 100000000001001011100000100101010at 32 bits, wrapping

Shifted left by 11001011100000100101010= 2,474,282, no wrap

Shifted right by 110010111000001001010= 618,570, discarding the low bit

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

Nearest landmarks

Next prime1,237,151+10

Previous prime1,237,139−2

Distance to nearest prime2

Nearest square below1,236,544

Nearest square above1,238,769

Powers & multiples

1,237,141 to the power 21,530,517,853,881

1,237,141 to the power 31,893,466,388,268,194,221

1,237,141 to the power 42,342,484,901,048,502,066,762,161

1,237,141 to the power 52,897,984,112,968,044,895,376,206,621,701

First ten multiples1,237,141, 2,474,282, 3,711,423, 4,948,564, 6,185,705, 7,422,846, 8,659,987, 9,897,128, 11,134,269, 12,371,410

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached3,711,4243× the starting value

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

First steps1,237,141 → 3,711,424 → 1,855,712 → 927,856 → 463,928 → 231,964 → 115,982 → 57,991 → 173,974 → 86,987 → …

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

As a percentage & fraction

As a percentage123,714,100%

1,237,141% as a decimal12,371.41

1,237,141% of 1001,237,141

1,237,141% of 1,00012,371,410

As a fraction of 1001,237,141/100

Read another way

As seconds14 days, 7 hours and 39 minutes

As bytes1.18 MiB

As a 24-bit colour#12E095

Keep nerding

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