Recognised as Number

1,510,401

Positive
Odd
Composite
7 digits

1,510,401 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,510,401

Digit count7

Digit sum12

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 79 × 6,373

Distinct prime factors33, 79, 6,373

Number of divisors8

Sum of divisors σ(n)2,039,680

Aliquot sum529,279sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)82,836the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 994,032

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 79, 237, 6,373, 19,119, 503,467, 1,510,4018 in total

Arithmetic

Previous number1,510,400

Next number1,510,402

Double3,020,802

Half755,200.5

Square2,281,311,180,801

Cube3,445,694,688,793,011,201

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

Cube root114.735396683≈

Negation-1,510,401

Reciprocal6.62075833 × 10^-7≈

Representations

Decimal1,510,401

Binary10111000011000000000121 bits

Octal5606001

Hexadecimal170C01

Base 36WDFL

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

In wordsone million, five hundred and ten thousand, four hundred and one

Ordinalone million, five hundred and ten thousand, four hundred and first

Scientific notation1.510401 × 10^6

Engineering notation1.510401 × 10^6

In other bases

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

Quinary341313101base 5; one hand: 9 digits

Septenary15560334base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101110000110000000001

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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

Bytes317 0c 01

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

At each machine width

32-bit00000000000101110000110000000001

64-bit0000000000000000000000000000000000000000000101110000110000000001

One's complement11111111111010001111001111111110at 32 bits, every bit flipped

Bits reversed10000000001100001110100000000000at 32 bits

Rotated left by 100000000001011100001100000000010at 32 bits, wrapping

Shifted left by 11011100001100000000010= 3,020,802, no wrap

Shifted right by 110111000011000000000= 755,200, discarding the low bit

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

Nearest landmarks

Next prime1,510,417+16

Previous prime1,510,393−8

Distance to nearest prime8

Nearest square below1,507,984

Nearest square above1,510,441

Powers & multiples

1,510,401 to the power 22,281,311,180,801

1,510,401 to the power 33,445,694,688,793,011,201

1,510,401 to the power 45,204,380,703,647,652,911,001,601

1,510,401 to the power 57,860,701,819,170,118,604,429,729,152,001

First ten multiples1,510,401, 3,020,802, 4,531,203, 6,041,604, 7,552,005, 9,062,406, 10,572,807, 12,083,208, 13,593,609, 15,104,010

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached4,531,2043× the starting value

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

First steps1,510,401 → 4,531,204 → 2,265,602 → 1,132,801 → 3,398,404 → 1,699,202 → 849,601 → 2,548,804 → 1,274,402 → 637,201 → …

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

As a percentage & fraction

As a percentage151,040,100%

1,510,401% as a decimal15,104.01

1,510,401% of 1001,510,401

1,510,401% of 1,00015,104,010

As a fraction of 1001,510,401/100

Read another way

As seconds17 days, 11 hours and 33 minutes

As bytes1.44 MiB

As a 24-bit colour#170C01

Keep nerding

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