Recognised as Number

1,506,733

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,506,733

Digit count7

Digit sum25

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,506,733

Distinct prime factors11,506,733

Number of divisors2

Sum of divisors σ(n)1,506,734

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,506,732the 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,506,7332 in total

Arithmetic

Previous number1,506,732

Next number1,506,734

Double3,013,466

Half753,366.5

Square2,270,244,333,289

Cube3,420,652,055,029,534,837

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

Cube root114.642443316≈

Negation-1,506,733

Reciprocal6.63687594 × 10^-7≈

Representations

Decimal1,506,733

Binary10110111111011010110121 bits

Octal5576655

Hexadecimal16FDAD

Base 36WALP

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

In wordsone million, five hundred and six thousand, seven hundred and thirty-three

Ordinalone million, five hundred and six thousand, seven hundred and thirty-third

Scientific notation1.506733 × 10^6

Engineering notation1.506733 × 10^6

In other bases

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

Quinary341203413base 5; one hand: 9 digits

Septenary15543544base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101101111110110101101

Bit length21 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits6within that length

Bit parityodd15 set bits, so odd; 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 fd ad

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

At each machine width

32-bit00000000000101101111110110101101

64-bit0000000000000000000000000000000000000000000101101111110110101101

One's complement11111111111010010000001001010010at 32 bits, every bit flipped

Bits reversed10110101101111110110100000000000at 32 bits

Rotated left by 100000000001011011111101101011010at 32 bits, wrapping

Shifted left by 11011011111101101011010= 3,013,466, no wrap

Shifted right by 110110111111011010110= 753,366, discarding the low bit

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

Nearest landmarks

Next prime1,506,749+16

Previous prime1,506,731−2

Distance to nearest prime0, it is prime

Nearest square below1,505,529

Nearest square above1,507,984

Powers & multiples

1,506,733 to the power 22,270,244,333,289

1,506,733 to the power 33,420,652,055,029,534,837

1,506,733 to the power 45,154,009,332,830,816,113,557,521

1,506,733 to the power 57,765,715,944,084,174,055,228,864,288,893

First ten multiples1,506,733, 3,013,466, 4,520,199, 6,026,932, 7,533,665, 9,040,398, 10,547,131, 12,053,864, 13,560,597, 15,067,330

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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached4,520,2003× the starting value

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

First steps1,506,733 → 4,520,200 → 2,260,100 → 1,130,050 → 565,025 → 1,695,076 → 847,538 → 423,769 → 1,271,308 → 635,654 → …

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

As a percentage & fraction

As a percentage150,673,300%

1,506,733% as a decimal15,067.33

1,506,733% of 1001,506,733

1,506,733% of 1,00015,067,330

As a fraction of 1001,506,733/100

Read another way

As seconds17 days, 10 hours and 32 minutes

As bytes1.437 MiB

As a 24-bit colour#16FDAD

Keep nerding

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