Recognised as Number

1,512,265

Positive
Odd
Composite
7 digits

1,512,265 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,512,265

Digit count7

Digit sum22

Digit product600

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 151 × 2,003

Distinct prime factors35, 151, 2,003

Number of divisors8

Sum of divisors σ(n)1,827,648

Aliquot sum315,383sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)300,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,201,200

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 151, 755, 2,003, 10,015, 302,453, 1,512,2658 in total

Arithmetic

Previous number1,512,264

Next number1,512,266

Double3,024,530

Half756,132.5

Square2,286,945,430,225

Cube3,458,467,531,039,209,625

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

Cube root114.782575955≈

Negation-1,512,265

Reciprocal6.61259766 × 10^-7≈

Representations

Decimal1,512,265

Binary10111000100110100100121 bits

Octal5611511

Hexadecimal171349

Base 36WEVD

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

In wordsone million, five hundred and twelve thousand, two hundred and sixty-five

Ordinalone million, five hundred and twelve thousand, two hundred and sixty-fifth

Scientific notation1.512265 × 10^6

Engineering notation1.512265 × 10^6

In other bases

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

Quinary341343030base 5; one hand: 9 digits

Septenary15565636base 7: 8 digits

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

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

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

Sexagesimal7:0:4:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110001001101001001

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes317 13 49

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

At each machine width

32-bit00000000000101110001001101001001

64-bit0000000000000000000000000000000000000000000101110001001101001001

One's complement11111111111010001110110010110110at 32 bits, every bit flipped

Bits reversed10010010110010001110100000000000at 32 bits

Rotated left by 100000000001011100010011010010010at 32 bits, wrapping

Shifted left by 11011100010011010010010= 3,024,530, no wrap

Shifted right by 110111000100110100100= 756,132, discarding the low bit

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

Nearest landmarks

Next prime1,512,281+16

Previous prime1,512,253−12

Distance to nearest prime12

Nearest square below1,510,441

Nearest square above1,512,900

Powers & multiples

1,512,265 to the power 22,286,945,430,225

1,512,265 to the power 33,458,467,531,039,209,625

1,512,265 to the power 45,230,119,400,827,010,343,550,625

1,512,265 to the power 57,909,326,515,691,658,797,189,585,915,625

First ten multiples1,512,265, 3,024,530, 4,536,795, 6,049,060, 7,561,325, 9,073,590, 10,585,855, 12,098,120, 13,610,385, 15,122,650

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time

Highest value reached7,655,8485× the starting value

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

First steps1,512,265 → 4,536,796 → 2,268,398 → 1,134,199 → 3,402,598 → 1,701,299 → 5,103,898 → 2,551,949 → 7,655,848 → 3,827,924 → …

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

As a percentage & fraction

As a percentage151,226,500%

1,512,265% as a decimal15,122.65

1,512,265% of 1001,512,265

1,512,265% of 1,00015,122,650

As a fraction of 1001,512,265/100

Read another way

As seconds17 days, 12 hours and 4 minutes

As bytes1.442 MiB

As a 24-bit colour#171349

Keep nerding

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