Recognised as Number

1,551,152

Positive
Even
Composite
7 digits

1,551,152 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,551,152

Digit count7

Digit sum20

Digit product250

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 29 × 3,343

Distinct prime factors32, 29, 3,343

Number of divisors20

Sum of divisors σ(n)3,109,920

Aliquot sum1,558,768sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)46,788the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 748,608

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 29, 58, 116, 232, 464, 3,343, 6,686, 13,372, 26,744, 53,488, 96,947, 193,894, 387,788, 775,576, 1,551,15220 in total

Arithmetic

Previous number1,551,151

Next number1,551,153

Double3,102,304

Half775,576

Square2,406,072,527,104

Cube3,732,184,212,562,423,808

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

Cube root115.758116665≈

Negation-1,551,152

Reciprocal6.44682146 × 10^-7≈

Representations

Decimal1,551,152

Binary10111101010110011000021 bits

Octal5725460

Hexadecimal17AB30

Base 36X8VK

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

In wordsone million, five hundred and fifty-one thousand, one hundred and fifty-two

Ordinalone million, five hundred and fifty-one thousand, one hundred and fifty-second

Scientific notation1.551152 × 10^6

Engineering notation1.551152 × 10^6

In other bases

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

Quinary344114102base 5; one hand: 9 digits

Septenary16120211base 7: 8 digits

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

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

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

Sexagesimal7:10:52:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101111010101100110000

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

Power of twoNo

Bytes317 ab 30

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

At each machine width

32-bit00000000000101111010101100110000

64-bit0000000000000000000000000000000000000000000101111010101100110000

One's complement11111111111010000101010011001111at 32 bits, every bit flipped

Bits reversed00001100110101011110100000000000at 32 bits

Rotated left by 100000000001011110101011001100000at 32 bits, wrapping

Shifted left by 11011110101011001100000= 3,102,304, no wrap

Shifted right by 110111101010110011000= 775,576, discarding the low bit

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

Nearest landmarks

Next prime1,551,157+5

Previous prime1,551,133−19

Distance to nearest prime5

Nearest square below1,550,025

Nearest square above1,552,516

Powers & multiples

1,551,152 to the power 22,406,072,527,104

1,551,152 to the power 33,732,184,212,562,423,808

1,551,152 to the power 45,789,185,005,684,628,814,626,816

1,551,152 to the power 58,979,905,899,937,723,355,066,014,892,032

First ten multiples1,551,152, 3,102,304, 4,653,456, 6,204,608, 7,755,760, 9,306,912, 10,858,064, 12,409,216, 13,960,368, 15,511,520

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 8

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time

Highest value reached1,551,152

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

First steps1,551,152 → 775,576 → 387,788 → 193,894 → 96,947 → 290,842 → 145,421 → 436,264 → 218,132 → 109,066 → …

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

As a percentage & fraction

As a percentage155,115,200%

1,551,152% as a decimal15,511.52

1,551,152% of 1001,551,152

1,551,152% of 1,00015,511,520

As a fraction of 1001,551,152/100

Read another way

As seconds17 days, 22 hours and 52 minutes

As bytes1.479 MiB

As a 24-bit colour#17AB30

Keep nerding

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