Recognised as Number

1,270,112

Positive
Even
Composite
7 digits

1,270,112 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,270,112

Digit count7

Digit sum14

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2^5 × 19 × 2,089

Distinct prime factors32, 19, 2,089

Number of divisors24

Sum of divisors σ(n)2,633,400

Aliquot sum1,363,288sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)601,344integers below n that share no factor with it

Carmichael function λ(n)2,088the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 601,344

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 19, 32, 38, 76, 152, 304, 608, 2,089, 4,178, 8,356, 16,712, 33,424, 39,691, 66,848, 79,382, 158,764, 317,528, 635,056, 1,270,11224 in total

Arithmetic

Previous number1,270,111

Next number1,270,113

Double2,540,224

Half635,056

Square1,613,184,492,544

Cube2,048,924,982,194,044,928

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

Cube root108.296396612≈

Negation-1,270,112

Reciprocal7.87332141 × 10^-7≈

Representations

Decimal1,270,112

Binary10011011000010110000021 bits

Octal4660540

Hexadecimal136160

Base 36R80W

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

In wordsone million, two hundred and seventy thousand, one hundred and twelve

Ordinalone million, two hundred and seventy thousand, one hundred and twelfth

Scientific notation1.270112 × 10^6

Engineering notation1.270112 × 10^6

In other bases

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

Quinary311120422base 5; one hand: 9 digits

Septenary13536644base 7: 8 digits

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

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

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

Sexagesimal5:52:48:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100110110000101100000

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 set bits, so even; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 55 trailing zeros

Power of twoNo

Bytes313 61 60

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

At each machine width

32-bit00000000000100110110000101100000

64-bit0000000000000000000000000000000000000000000100110110000101100000

One's complement11111111111011001001111010011111at 32 bits, every bit flipped

Bits reversed00000110100001101100100000000000at 32 bits

Rotated left by 100000000001001101100001011000000at 32 bits, wrapping

Shifted left by 11001101100001011000000= 2,540,224, no wrap

Shifted right by 110011011000010110000= 635,056, discarding the low bit

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

Nearest landmarks

Next prime1,270,123+11

Previous prime1,270,111−1

Distance to nearest prime1

Nearest square below1,267,876

Nearest square above1,270,129

Powers & multiples

1,270,112 to the power 21,613,184,492,544

1,270,112 to the power 32,048,924,982,194,044,928

1,270,112 to the power 42,602,364,206,984,442,791,591,936

1,270,112 to the power 53,305,294,007,661,424,602,914,417,016,832

First ten multiples1,270,112, 2,540,224, 3,810,336, 5,080,448, 6,350,560, 7,620,672, 8,890,784, 10,160,896, 11,431,008, 12,701,120

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12No, remainder 8

Divisible by 100No, remainder 12

Collatz (3n + 1) trajectory

Steps to reach 1124the total stopping time

Highest value reached1,270,112

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

First steps1,270,112 → 635,056 → 317,528 → 158,764 → 79,382 → 39,691 → 119,074 → 59,537 → 178,612 → 89,306 → …

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

As a percentage & fraction

As a percentage127,011,200%

1,270,112% as a decimal12,701.12

1,270,112% of 1001,270,112

1,270,112% of 1,00012,701,120

As a fraction of 1001,270,112/100

Read another way

As seconds14 days, 16 hours and 48 minutes

As bytes1.211 MiB

As a 24-bit colour#136160

Keep nerding

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