Recognised as Number

1,452,377

Positive
Odd
Prime
7 digits

1,452,377 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,452,377

Digit count7

Digit sum29

Digit product5,880

Multiplicative persistence2times 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 factorisation1,452,377

Distinct prime factors11,452,377

Number of divisors2

Sum of divisors σ(n)1,452,378

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,452,376integers below n that share no factor with it

Carmichael function λ(n)1,452,376the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 1,452,3772 in total

Arithmetic

Previous number1,452,376

Next number1,452,378

Double2,904,754

Half726,188.5

Square2,109,398,950,129

Cube3,063,642,518,991,506,633

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

Cube root113.246934343≈

Negation-1,452,377

Reciprocal6.88526464 × 10^-7≈

Representations

Decimal1,452,377

Binary10110001010010101100121 bits

Octal5424531

Hexadecimal162959

Base 36V4NT

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

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

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

Scientific notation1.452377 × 10^6

Engineering notation1.452377 × 10^6

In other bases

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

Quinary332434002base 5; one hand: 9 digits

Septenary15226223base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101100010100101011001

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes316 29 59

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

At each machine width

32-bit00000000000101100010100101011001

64-bit0000000000000000000000000000000000000000000101100010100101011001

One's complement11111111111010011101011010100110at 32 bits, every bit flipped

Bits reversed10011010100101000110100000000000at 32 bits

Rotated left by 100000000001011000101001010110010at 32 bits, wrapping

Shifted left by 11011000101001010110010= 2,904,754, no wrap

Shifted right by 110110001010010101100= 726,188, discarding the low bit

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

Nearest landmarks

Next prime1,452,383+6

Previous prime1,452,329−48

Distance to nearest prime0, it is prime

Nearest square below1,452,025

Nearest square above1,454,436

Powers & multiples

1,452,377 to the power 22,109,398,950,129

1,452,377 to the power 33,063,642,518,991,506,633

1,452,377 to the power 44,449,563,930,805,327,429,116,641

1,452,377 to the power 56,462,444,313,131,249,035,518,139,705,657

First ten multiples1,452,377, 2,904,754, 4,357,131, 5,809,508, 7,261,885, 8,714,262, 10,166,639, 11,619,016, 13,071,393, 14,523,770

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached4,901,7763× the starting value

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

First steps1,452,377 → 4,357,132 → 2,178,566 → 1,089,283 → 3,267,850 → 1,633,925 → 4,901,776 → 2,450,888 → 1,225,444 → 612,722 → …

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

As a percentage & fraction

As a percentage145,237,700%

1,452,377% as a decimal14,523.77

1,452,377% of 1001,452,377

1,452,377% of 1,00014,523,770

As a fraction of 1001,452,377/100

Read another way

As seconds16 days, 19 hours and 26 minutes

As bytes1.385 MiB

As a 24-bit colour#162959

Keep nerding

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