Recognised as Number

1,508,063

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,508,063

Digit count7

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,508,063

Distinct prime factors11,508,063

Number of divisors2

Sum of divisors σ(n)1,508,064

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,508,062the 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,508,0632 in total

Arithmetic

Previous number1,508,062

Next number1,508,064

Double3,016,126

Half754,031.5

Square2,274,254,011,969

Cube3,429,718,328,052,006,047

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

Cube root114.676165196≈

Negation-1,508,063

Reciprocal6.63102271 × 10^-7≈

Representations

Decimal1,508,063

Binary10111000000101101111121 bits

Octal5601337

Hexadecimal1702DF

Base 36WBMN

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

In wordsone million, five hundred and eight thousand and sixty-three

Ordinalone million, five hundred and eight thousand and sixty-third

Scientific notation1.508063 × 10^6

Engineering notation1.508063 × 10^6

In other bases

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

Quinary341224223base 5; one hand: 9 digits

Septenary15550454base 7: 8 digits

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

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

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

Sexagesimal6:58:54:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110000001011011111

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 02 df

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

At each machine width

32-bit00000000000101110000001011011111

64-bit0000000000000000000000000000000000000000000101110000001011011111

One's complement11111111111010001111110100100000at 32 bits, every bit flipped

Bits reversed11111011010000001110100000000000at 32 bits

Rotated left by 100000000001011100000010110111110at 32 bits, wrapping

Shifted left by 11011100000010110111110= 3,016,126, no wrap

Shifted right by 110111000000101101111= 754,031, discarding the low bit

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

Nearest landmarks

Next prime1,508,077+14

Previous prime1,508,051−12

Distance to nearest prime0, it is prime

Nearest square below1,507,984

Nearest square above1,510,441

Powers & multiples

1,508,063 to the power 22,274,254,011,969

1,508,063 to the power 33,429,718,328,052,006,047

1,508,063 to the power 45,172,231,310,957,092,395,256,961

1,508,063 to the power 57,800,050,667,495,885,628,868,398,376,543

First ten multiples1,508,063, 3,016,126, 4,524,189, 6,032,252, 7,540,315, 9,048,378, 10,556,441, 12,064,504, 13,572,567, 15,080,630

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 11

Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1225the total stopping time

Highest value reached22,903,72015× the starting value

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

First steps1,508,063 → 4,524,190 → 2,262,095 → 6,786,286 → 3,393,143 → 10,179,430 → 5,089,715 → 15,269,146 → 7,634,573 → 22,903,720 → …

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

As a percentage & fraction

As a percentage150,806,300%

1,508,063% as a decimal15,080.63

1,508,063% of 1001,508,063

1,508,063% of 1,00015,080,630

As a fraction of 1001,508,063/100

Read another way

As seconds17 days, 10 hours and 54 minutes

As bytes1.438 MiB

As a 24-bit colour#1702DF

Keep nerding

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