Recognised as Number

1,190,472

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,190,472

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3 × 49,603

Distinct prime factors32, 3, 49,603

Number of divisors16

Sum of divisors σ(n)2,976,240

Aliquot sum1,785,768sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)49,602the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 396,816

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 24, 49,603, 99,206, 148,809, 198,412, 297,618, 396,824, 595,236, 1,190,47216 in total

Arithmetic

Previous number1,190,471

Next number1,190,473

Double2,380,944

Half595,236

Square1,417,223,582,784

Cube1,687,164,993,044,034,048

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

Cube root105.98385894≈

Negation-1,190,472

Reciprocal8.40002957 × 10^-7≈

Representations

Decimal1,190,472

Binary10010001010100100100021 bits

Octal4425110

Hexadecimal122A48

Base 36PIKO

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

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

Ordinalone million, one hundred and ninety thousand, four hundred and seventy-second

Scientific notation1.190472 × 10^6

Engineering notation1.190472 × 10^6

In other bases

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

Quinary301043342base 5; one hand: 9 digits

Septenary13055523base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100100010101001001000

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 33 trailing zeros

Power of twoNo

Bytes312 2a 48

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

At each machine width

32-bit00000000000100100010101001001000

64-bit0000000000000000000000000000000000000000000100100010101001001000

One's complement11111111111011011101010110110111at 32 bits, every bit flipped

Bits reversed00010010010101000100100000000000at 32 bits

Rotated left by 100000000001001000101010010010000at 32 bits, wrapping

Shifted left by 11001000101010010010000= 2,380,944, no wrap

Shifted right by 110010001010100100100= 595,236, discarding the low bit

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

Nearest landmarks

Next prime1,190,473+1

Previous prime1,190,467−5

Distance to nearest prime1

Nearest square below1,190,281

Nearest square above1,192,464

Powers & multiples

1,190,472 to the power 21,417,223,582,784

1,190,472 to the power 31,687,164,993,044,034,048

1,190,472 to the power 42,008,522,683,599,117,301,190,656

1,190,472 to the power 52,391,090,016,189,608,371,783,042,629,632

First ten multiples1,190,472, 2,380,944, 3,571,416, 4,761,888, 5,952,360, 7,142,832, 8,333,304, 9,523,776, 10,714,248, 11,904,720

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12Yes

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached1,190,472

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

First steps1,190,472 → 595,236 → 297,618 → 148,809 → 446,428 → 223,214 → 111,607 → 334,822 → 167,411 → 502,234 → …

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

As a percentage & fraction

As a percentage119,047,200%

1,190,472% as a decimal11,904.72

1,190,472% of 1001,190,472

1,190,472% of 1,00011,904,720

As a fraction of 1001,190,472/100

Read another way

As seconds13 days, 18 hours and 41 minutes

As bytes1.135 MiB

As a 24-bit colour#122A48

Keep nerding

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