Recognised as Number

1,509,266

Positive
Even
Composite
7 digits

1,509,266 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,509,266

Digit count7

Digit sum29

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2 × 11 × 31 × 2,213

Distinct prime factors42, 11, 31, 2,213

Number of divisors16

Sum of divisors σ(n)2,550,528

Aliquot sum1,041,262sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 663,600

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 11, 22, 31, 62, 341, 682, 2,213, 4,426, 24,343, 48,686, 68,603, 137,206, 754,633, 1,509,26616 in total

Arithmetic

Previous number1,509,265

Next number1,509,267

Double3,018,532

Half754,633

Square2,277,883,858,756

Cube3,437,932,659,969,233,096

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

Cube root114.706649944≈

Negation-1,509,266

Reciprocal6.62573728 × 10^-7≈

Representations

Decimal1,509,266

Binary10111000001111001001021 bits

Octal5603622

Hexadecimal170792

Base 36WCK2

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

In wordsone million, five hundred and nine thousand, two hundred and sixty-six

Ordinalone million, five hundred and nine thousand, two hundred and sixty-sixth

Scientific notation1.509266 × 10^6

Engineering notation1.509266 × 10^6

In other bases

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

Quinary341244031base 5; one hand: 9 digits

Septenary15554123base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101110000011110010010

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 even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes317 07 92

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

At each machine width

32-bit00000000000101110000011110010010

64-bit0000000000000000000000000000000000000000000101110000011110010010

One's complement11111111111010001111100001101101at 32 bits, every bit flipped

Bits reversed01001001111000001110100000000000at 32 bits

Rotated left by 100000000001011100000111100100100at 32 bits, wrapping

Shifted left by 11011100000111100100100= 3,018,532, no wrap

Shifted right by 110111000001111001001= 754,633, discarding the low bit

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

Nearest landmarks

Next prime1,509,269+3

Previous prime1,509,229−37

Distance to nearest prime3

Nearest square below1,507,984

Nearest square above1,510,441

Powers & multiples

1,509,266 to the power 22,277,883,858,756

1,509,266 to the power 33,437,932,659,969,233,096

1,509,266 to the power 45,188,754,873,981,124,557,867,536

1,509,266 to the power 57,831,211,313,633,995,936,954,504,588,576

First ten multiples1,509,266, 3,018,532, 4,527,798, 6,037,064, 7,546,330, 9,055,596, 10,564,862, 12,074,128, 13,583,394, 15,092,660

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 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10No, remainder 6

Divisible by 11Yes

Divisible by 12No, remainder 2

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 1256the total stopping time

Highest value reached6,810,1364× the starting value

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

First steps1,509,266 → 754,633 → 2,263,900 → 1,131,950 → 565,975 → 1,697,926 → 848,963 → 2,546,890 → 1,273,445 → 3,820,336 → …

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

As a percentage & fraction

As a percentage150,926,600%

1,509,266% as a decimal15,092.66

1,509,266% of 1001,509,266

1,509,266% of 1,00015,092,660

As a fraction of 1001,509,266/100

Read another way

As seconds17 days, 11 hours and 14 minutes

As bytes1.439 MiB

As a 24-bit colour#170792

Keep nerding

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