Recognised as Number

1,114,210

Positive
Even
Composite
7 digits

1,114,210 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,114,210

Digit count7

Digit sum10

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 67 × 1,663

Distinct prime factors42, 5, 67, 1,663

Number of divisors16

Sum of divisors σ(n)2,036,736

Aliquot sum922,526sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)36,564the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 438,768

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 67, 134, 335, 670, 1,663, 3,326, 8,315, 16,630, 111,421, 222,842, 557,105, 1,114,21016 in total

Arithmetic

Previous number1,114,209

Next number1,114,211

Double2,228,420

Half557,105

Square1,241,463,924,100

Cube1,383,251,518,871,461,000

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

Cube root103.670617169≈

Negation-1,114,210

Reciprocal8.97496881 × 10^-7≈

Representations

Decimal1,114,210

Binary10001000000000110001021 bits

Octal4200142

Hexadecimal110062

Base 36NVQA

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

In wordsone million, one hundred and fourteen thousand, two hundred and ten

Ordinalone million, one hundred and fourteen thousand, two hundred and tenth

Scientific notation1.11421 × 10^6

Engineering notation1.11421 × 10^6

In other bases

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

Quinary241123320base 5; one hand: 9 digits

Septenary12320266base 7: 8 digits

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

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

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

Sexagesimal5:9:30:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100010000000001100010

Bit length21 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits16within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes311 00 62

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

At each machine width

32-bit00000000000100010000000001100010

64-bit0000000000000000000000000000000000000000000100010000000001100010

One's complement11111111111011101111111110011101at 32 bits, every bit flipped

Bits reversed01000110000000001000100000000000at 32 bits

Rotated left by 100000000001000100000000011000100at 32 bits, wrapping

Shifted left by 11000100000000011000100= 2,228,420, no wrap

Shifted right by 110001000000000110001= 557,105, discarding the low bit

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

Nearest landmarks

Next prime1,114,213+3

Previous prime1,114,207−3

Distance to nearest prime3

Nearest square below1,113,025

Nearest square above1,115,136

Powers & multiples

1,114,210 to the power 21,241,463,924,100

1,114,210 to the power 31,383,251,518,871,461,000

1,114,210 to the power 41,541,232,674,841,770,560,810,000

1,114,210 to the power 51,717,256,858,635,449,176,560,110,100,000

First ten multiples1,114,210, 2,228,420, 3,342,630, 4,456,840, 5,571,050, 6,685,260, 7,799,470, 8,913,680, 10,027,890, 11,142,100

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 9

Divisible by 12No, remainder 10

Divisible by 100No, remainder 10

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached2,035,3481× the starting value

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

First steps1,114,210 → 557,105 → 1,671,316 → 835,658 → 417,829 → 1,253,488 → 626,744 → 313,372 → 156,686 → 78,343 → …

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

As a percentage & fraction

As a percentage111,421,000%

1,114,210% as a decimal11,142.1

1,114,210% of 1001,114,210

1,114,210% of 1,00011,142,100

As a fraction of 1001,114,210/100

Read another way

As seconds12 days, 21 hours and 30 minutes

As bytes1.063 MiB

As a 24-bit colour#110062

Keep nerding

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