Recognised as Number

1,461,972

Positive
Even
Composite
7 digits

1,461,972 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,461,972

Digit count7

Digit sum30

Digit product3,024

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 23 × 5,297

Distinct prime factors42, 3, 23, 5,297

Number of divisors24

Sum of divisors σ(n)3,560,256

Aliquot sum2,098,284sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)58,256the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 466,048

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 23, 46, 69, 92, 138, 276, 5,297, 10,594, 15,891, 21,188, 31,782, 63,564, 121,831, 243,662, 365,493, 487,324, 730,986, 1,461,97224 in total

Arithmetic

Previous number1,461,971

Next number1,461,973

Double2,923,944

Half730,986

Square2,137,362,128,784

Cube3,124,763,586,142,602,048

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

Cube root113.49577245≈

Negation-1,461,972

Reciprocal6.84007628 × 10^-7≈

Representations

Decimal1,461,972

Binary10110010011101101010021 bits

Octal5447324

Hexadecimal164ED4

Base 36VC2C

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

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

Ordinalone million, four hundred and sixty-one thousand, nine hundred and seventy-second

Scientific notation1.461972 × 10^6

Engineering notation1.461972 × 10^6

In other bases

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

Quinary333240342base 5; one hand: 9 digits

Septenary15266211base 7: 8 digits

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

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

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

Sexagesimal6:46:6:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101100100111011010100

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 set bits, so odd; 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

Bytes316 4e d4

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

At each machine width

32-bit00000000000101100100111011010100

64-bit0000000000000000000000000000000000000000000101100100111011010100

One's complement11111111111010011011000100101011at 32 bits, every bit flipped

Bits reversed00101011011100100110100000000000at 32 bits

Rotated left by 100000000001011001001110110101000at 32 bits, wrapping

Shifted left by 11011001001110110101000= 2,923,944, no wrap

Shifted right by 110110010011101101010= 730,986, discarding the low bit

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

Nearest landmarks

Next prime1,461,973+1

Previous prime1,461,953−19

Distance to nearest prime1

Nearest square below1,461,681

Nearest square above1,464,100

Powers & multiples

1,461,972 to the power 22,137,362,128,784

1,461,972 to the power 33,124,763,586,142,602,048

1,461,972 to the power 44,568,316,869,560,072,201,318,656

1,461,972 to the power 56,678,751,350,424,477,876,306,238,149,632

First ten multiples1,461,972, 2,923,944, 4,385,916, 5,847,888, 7,309,860, 8,771,832, 10,233,804, 11,695,776, 13,157,748, 14,619,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 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12Yes

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached1,461,972

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

First steps1,461,972 → 730,986 → 365,493 → 1,096,480 → 548,240 → 274,120 → 137,060 → 68,530 → 34,265 → 102,796 → …

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

As a percentage & fraction

As a percentage146,197,200%

1,461,972% as a decimal14,619.72

1,461,972% of 1001,461,972

1,461,972% of 1,00014,619,720

As a fraction of 1001,461,972/100

Read another way

As seconds16 days, 22 hours and 6 minutes

As bytes1.394 MiB

As a 24-bit colour#164ED4

Keep nerding

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