Recognised as Number

1,452,372

Positive
Even
Composite
7 digits

1,452,372 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,452,372

Digit count7

Digit sum24

Digit product1,680

Multiplicative persistence2times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 127 × 953

Distinct prime factors42, 3, 127, 953

Number of divisors24

Sum of divisors σ(n)3,419,136

Aliquot sum1,966,764sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)8,568the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 479,808

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 127, 254, 381, 508, 762, 953, 1,524, 1,906, 2,859, 3,812, 5,718, 11,436, 121,031, 242,062, 363,093, 484,124, 726,186, 1,452,37224 in total

Arithmetic

Previous number1,452,371

Next number1,452,373

Double2,904,744

Half726,186

Square2,109,384,426,384

Cube3,063,610,878,116,182,848

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

Cube root113.246804387≈

Negation-1,452,372

Reciprocal6.88528834 × 10^-7≈

Representations

Decimal1,452,372

Binary10110001010010101010021 bits

Octal5424524

Hexadecimal162954

Base 36V4NO

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

In wordsone million, four hundred and fifty-two thousand, three hundred and seventy-two

Ordinalone million, four hundred and fifty-two thousand, three hundred and seventy-second

Scientific notation1.452372 × 10^6

Engineering notation1.452372 × 10^6

In other bases

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

Quinary332433442base 5; one hand: 9 digits

Septenary15226215base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101100010100101010100

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 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 29 54

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

At each machine width

32-bit00000000000101100010100101010100

64-bit0000000000000000000000000000000000000000000101100010100101010100

One's complement11111111111010011101011010101011at 32 bits, every bit flipped

Bits reversed00101010100101000110100000000000at 32 bits

Rotated left by 100000000001011000101001010101000at 32 bits, wrapping

Shifted left by 11011000101001010101000= 2,904,744, no wrap

Shifted right by 110110001010010101010= 726,186, discarding the low bit

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

Nearest landmarks

Next prime1,452,377+5

Previous prime1,452,329−43

Distance to nearest prime5

Nearest square below1,452,025

Nearest square above1,454,436

Powers & multiples

1,452,372 to the power 22,109,384,426,384

1,452,372 to the power 33,063,610,878,116,182,848

1,452,372 to the power 44,449,502,658,271,356,715,315,456

1,452,372 to the power 56,462,333,074,798,886,895,336,139,461,632

First ten multiples1,452,372, 2,904,744, 4,357,116, 5,809,488, 7,261,860, 8,714,232, 10,166,604, 11,618,976, 13,071,348, 14,523,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 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12Yes

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 1212the total stopping time

Highest value reached6,810,1364× the starting value

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

First steps1,452,372 → 726,186 → 363,093 → 1,089,280 → 544,640 → 272,320 → 136,160 → 68,080 → 34,040 → 17,020 → …

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

As a percentage & fraction

As a percentage145,237,200%

1,452,372% as a decimal14,523.72

1,452,372% of 1001,452,372

1,452,372% of 1,00014,523,720

As a fraction of 1001,452,372/100

Read another way

As seconds16 days, 19 hours and 26 minutes

As bytes1.385 MiB

As a 24-bit colour#162954

Keep nerding

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