Recognised as Number

1,192,070

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,192,070

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2 × 5 × 11 × 10,837

Distinct prime factors42, 5, 11, 10,837

Number of divisors16

Sum of divisors σ(n)2,341,008

Aliquot sum1,148,938sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)54,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 433,440

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 11, 22, 55, 110, 10,837, 21,674, 54,185, 108,370, 119,207, 238,414, 596,035, 1,192,07016 in total

Arithmetic

Previous number1,192,069

Next number1,192,071

Double2,384,140

Half596,035

Square1,421,030,884,900

Cube1,693,968,286,962,743,000

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

Cube root106.031259322≈

Negation-1,192,070

Reciprocal8.38876912 × 10^-7≈

Representations

Decimal1,192,070

Binary10010001100001000011021 bits

Octal4430206

Hexadecimal123086

Base 36PJT2

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

In wordsone million, one hundred and ninety-two thousand and seventy

Ordinalone million, one hundred and ninety-two thousand and seventieth

Scientific notation1.19207 × 10^6

Engineering notation1.19207 × 10^6

In other bases

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

Quinary301121240base 5; one hand: 9 digits

Septenary13063265base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100100011000010000110

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 30 86

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

At each machine width

32-bit00000000000100100011000010000110

64-bit0000000000000000000000000000000000000000000100100011000010000110

One's complement11111111111011011100111101111001at 32 bits, every bit flipped

Bits reversed01100001000011000100100000000000at 32 bits

Rotated left by 100000000001001000110000100001100at 32 bits, wrapping

Shifted left by 11001000110000100001100= 2,384,140, no wrap

Shifted right by 110010001100001000011= 596,035, discarding the low bit

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

Nearest landmarks

Next prime1,192,073+3

Previous prime1,192,069−1

Distance to nearest prime1

Nearest square below1,190,281

Nearest square above1,192,464

Powers & multiples

1,192,070 to the power 21,421,030,884,900

1,192,070 to the power 31,693,968,286,962,743,000

1,192,070 to the power 42,019,328,775,839,677,048,010,000

1,192,070 to the power 52,407,181,253,815,203,818,621,280,700,000

First ten multiples1,192,070, 2,384,140, 3,576,210, 4,768,280, 5,960,350, 7,152,420, 8,344,490, 9,536,560, 10,728,630, 11,920,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 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11Yes

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time

Highest value reached2,682,1602× the starting value

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

First steps1,192,070 → 596,035 → 1,788,106 → 894,053 → 2,682,160 → 1,341,080 → 670,540 → 335,270 → 167,635 → 502,906 → …

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

As a percentage & fraction

As a percentage119,207,000%

1,192,070% as a decimal11,920.7

1,192,070% of 1001,192,070

1,192,070% of 1,00011,920,700

As a fraction of 1001,192,070/100

Read another way

As seconds13 days, 19 hours and 7 minutes

As bytes1.137 MiB

As a 24-bit colour#123086

Keep nerding

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