Recognised as Number

1,210,370

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,210,370

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

Factors & divisors

Prime factorisation2 × 5 × 7 × 17,291

Distinct prime factors42, 5, 7, 17,291

Number of divisors16

Sum of divisors σ(n)2,490,048

Aliquot sum1,279,678sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)103,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 414,960

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 7, 10, 14, 35, 70, 17,291, 34,582, 86,455, 121,037, 172,910, 242,074, 605,185, 1,210,37016 in total

Arithmetic

Previous number1,210,369

Next number1,210,371

Double2,420,740

Half605,185

Square1,464,995,536,900

Cube1,773,186,647,997,653,000

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

Cube root106.57108408≈

Negation-1,210,370

Reciprocal8.26193643 × 10^-7≈

Representations

Decimal1,210,370

Binary10010011110000000001021 bits

Octal4474002

Hexadecimal127802

Base 36PXXE

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

In wordsone million, two hundred and ten thousand, three hundred and seventy

Ordinalone million, two hundred and ten thousand, three hundred and seventieth

Scientific notation1.21037 × 10^6

Engineering notation1.21037 × 10^6

In other bases

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

Quinary302212440base 5; one hand: 9 digits

Septenary13200530base 7: 8 digits

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

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

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

Sexagesimal5:36:12:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100100111100000000010

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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

Bytes312 78 02

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

At each machine width

32-bit00000000000100100111100000000010

64-bit0000000000000000000000000000000000000000000100100111100000000010

One's complement11111111111011011000011111111101at 32 bits, every bit flipped

Bits reversed01000000000111100100100000000000at 32 bits

Rotated left by 100000000001001001111000000000100at 32 bits, wrapping

Shifted left by 11001001111000000000100= 2,420,740, no wrap

Shifted right by 110010011110000000001= 605,185, discarding the low bit

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

Nearest landmarks

Next prime1,210,379+9

Previous prime1,210,369−1

Distance to nearest prime1

Nearest square below1,210,000

Nearest square above1,212,201

Powers & multiples

1,210,370 to the power 21,464,995,536,900

1,210,370 to the power 31,773,186,647,997,653,000

1,210,370 to the power 42,146,211,923,136,919,261,610,000

1,210,370 to the power 52,597,710,525,407,232,966,674,895,700,000

First ten multiples1,210,370, 2,420,740, 3,631,110, 4,841,480, 6,051,850, 7,262,220, 8,472,590, 9,682,960, 10,893,330, 12,103,700

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 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 7

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached4,197,4003× the starting value

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

First steps1,210,370 → 605,185 → 1,815,556 → 907,778 → 453,889 → 1,361,668 → 680,834 → 340,417 → 1,021,252 → 510,626 → …

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

As a percentage & fraction

As a percentage121,037,000%

1,210,370% as a decimal12,103.7

1,210,370% of 1001,210,370

1,210,370% of 1,00012,103,700

As a fraction of 1001,210,370/100

Read another way

As seconds14 days, 12 minutes and 50 seconds

As bytes1.154 MiB

As a 24-bit colour#127802

Keep nerding

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