Recognised as Number

1,532,987

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,532,987

Digit count7

Digit sum35

Digit product15,120

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,532,987

Distinct prime factors11,532,987

Number of divisors2

Sum of divisors σ(n)1,532,988

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,532,986the 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,532,9872 in total

Arithmetic

Previous number1,532,986

Next number1,532,988

Double3,065,974

Half766,493.5

Square2,350,049,142,169

Cube3,602,594,784,306,228,803

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

Cube root115.304473569≈

Negation-1,532,987

Reciprocal6.52321253 × 10^-7≈

Representations

Decimal1,532,987

Binary10111011001000011101121 bits

Octal5662073

Hexadecimal17643B

Base 36WUUZ

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

In wordsone million, five hundred and thirty-two thousand, nine hundred and eighty-seven

Ordinalone million, five hundred and thirty-two thousand, nine hundred and eighty-seventh

Scientific notation1.532987 × 10^6

Engineering notation1.532987 × 10^6

In other bases

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

Quinary343023422base 5; one hand: 9 digits

Septenary16013231base 7: 8 digits

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

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

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

Sexagesimal7:5:49:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110110010000111011

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes317 64 3b

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

At each machine width

32-bit00000000000101110110010000111011

64-bit0000000000000000000000000000000000000000000101110110010000111011

One's complement11111111111010001001101111000100at 32 bits, every bit flipped

Bits reversed11011100001001101110100000000000at 32 bits

Rotated left by 100000000001011101100100001110110at 32 bits, wrapping

Shifted left by 11011101100100001110110= 3,065,974, no wrap

Shifted right by 110111011001000011101= 766,493, discarding the low bit

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

Nearest landmarks

Next prime1,533,029+42

Previous prime1,532,983−4

Distance to nearest prime0, it is prime

Nearest square below1,532,644

Nearest square above1,535,121

Powers & multiples

1,532,987 to the power 22,350,049,142,169

1,532,987 to the power 33,602,594,784,306,228,803

1,532,987 to the power 45,522,730,970,609,252,774,024,561

1,532,987 to the power 58,466,274,782,441,366,582,293,589,693,707

First ten multiples1,532,987, 3,065,974, 4,598,961, 6,131,948, 7,664,935, 9,197,922, 10,730,909, 12,263,896, 13,796,883, 15,329,870

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1225the total stopping time

Highest value reached7,760,7525× the starting value

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

First steps1,532,987 → 4,598,962 → 2,299,481 → 6,898,444 → 3,449,222 → 1,724,611 → 5,173,834 → 2,586,917 → 7,760,752 → 3,880,376 → …

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

As a percentage & fraction

As a percentage153,298,700%

1,532,987% as a decimal15,329.87

1,532,987% of 1001,532,987

1,532,987% of 1,00015,329,870

As a fraction of 1001,532,987/100

Read another way

As seconds17 days, 17 hours and 49 minutes

As bytes1.462 MiB

As a 24-bit colour#17643B

Keep nerding

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