Recognised as Number

1,920,468

Positive
Even
Composite
7 digits

1,920,468 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,920,468

Digit count7

Digit sum30

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 11 × 14,549

Distinct prime factors42, 3, 11, 14,549

Number of divisors24

Sum of divisors σ(n)4,888,800

Aliquot sum2,968,332sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 132, 14,549, 29,098, 43,647, 58,196, 87,294, 160,039, 174,588, 320,078, 480,117, 640,156, 960,234, 1,920,46824 in total

Arithmetic

Previous number1,920,467

Next number1,920,469

Double3,840,936

Half960,234

Square3,688,197,339,024

Cube7,083,064,967,280,743,232

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

Cube root124.299397923≈

Negation-1,920,468

Reciprocal5.20706411 × 10^-7≈

Representations

Decimal1,920,468

Binary11101010011011101010021 bits

Octal7246724

Hexadecimal1D4DD4

Base 36155UC

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

In wordsone million, nine hundred and twenty thousand, four hundred and sixty-eight

Ordinalone million, nine hundred and twenty thousand, four hundred and sixty-eighth

Scientific notation1.920468 × 10^6

Engineering notation1.920468 × 10^6

In other bases

Ternary10121120101110base 3; the most digit-efficient integer base after e: 14 digits

Quinary442423333base 5; one hand: 9 digits

Septenary22216014base 7: 8 digits

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

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

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

Sexagesimal8:53:27:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000111010100110111010100

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes31d 4d d4

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

At each machine width

32-bit00000000000111010100110111010100

64-bit0000000000000000000000000000000000000000000111010100110111010100

One's complement11111111111000101011001000101011at 32 bits, every bit flipped

Bits reversed00101011101100101011100000000000at 32 bits

Rotated left by 100000000001110101001101110101000at 32 bits, wrapping

Shifted left by 11110101001101110101000= 3,840,936, no wrap

Shifted right by 111101010011011101010= 960,234, discarding the low bit

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

Nearest landmarks

Next prime1,920,469+1

Previous prime1,920,437−31

Distance to nearest prime1

Nearest square below1,918,225

Nearest square above1,920,996

Powers & multiples

1,920,468 to the power 23,688,197,339,024

1,920,468 to the power 37,083,064,967,280,743,232

1,920,468 to the power 413,602,799,611,583,714,393,272,576

1,920,468 to the power 526,123,741,364,458,952,813,419,397,485,568

First ten multiples1,920,468, 3,840,936, 5,761,404, 7,681,872, 9,602,340, 11,522,808, 13,443,276, 15,363,744, 17,284,212, 19,204,680

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 3

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 8

Divisible by 11Yes

Divisible by 12Yes

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time

Highest value reached1,920,468

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

First steps1,920,468 → 960,234 → 480,117 → 1,440,352 → 720,176 → 360,088 → 180,044 → 90,022 → 45,011 → 135,034 → …

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

As a percentage & fraction

As a percentage192,046,800%

1,920,468% as a decimal19,204.68

1,920,468% of 1001,920,468

1,920,468% of 1,00019,204,680

As a fraction of 1001,920,468/100

Read another way

As seconds22 days, 5 hours and 27 minutes

As bytes1.832 MiB

As a 24-bit colour#1D4DD4

Keep nerding

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