Recognised as Number

1,476,701

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,476,701

Digit count7

Digit sum26

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,476,701

Distinct prime factors11,476,701

Number of divisors2

Sum of divisors σ(n)1,476,702

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,476,700the 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,476,7012 in total

Arithmetic

Previous number1,476,700

Next number1,476,702

Double2,953,402

Half738,350.5

Square2,180,645,843,401

Cube3,220,161,897,596,100,101

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

Cube root113.875646694≈

Negation-1,476,701

Reciprocal6.77185158 × 10^-7≈

Representations

Decimal1,476,701

Binary10110100010000101110121 bits

Octal5504135

Hexadecimal16885D

Base 36VNFH

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

In wordsone million, four hundred and seventy-six thousand, seven hundred and one

Ordinalone million, four hundred and seventy-six thousand, seven hundred and first

Scientific notation1.476701 × 10^6

Engineering notation1.476701 × 10^6

In other bases

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

Quinary334223301base 5; one hand: 9 digits

Septenary15360152base 7: 8 digits

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

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

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

Sexagesimal6:50:11:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101101000100001011101

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

Bytes316 88 5d

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

At each machine width

32-bit00000000000101101000100001011101

64-bit0000000000000000000000000000000000000000000101101000100001011101

One's complement11111111111010010111011110100010at 32 bits, every bit flipped

Bits reversed10111010000100010110100000000000at 32 bits

Rotated left by 100000000001011010001000010111010at 32 bits, wrapping

Shifted left by 11011010001000010111010= 2,953,402, no wrap

Shifted right by 110110100010000101110= 738,350, discarding the low bit

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

Nearest landmarks

Next prime1,476,703+2

Previous prime1,476,691−10

Distance to nearest prime0, it is prime

Nearest square below1,476,225

Nearest square above1,478,656

Powers & multiples

1,476,701 to the power 22,180,645,843,401

1,476,701 to the power 33,220,161,897,596,100,101

1,476,701 to the power 44,755,216,294,342,058,615,246,801

1,476,701 to the power 57,022,032,657,071,212,299,193,566,283,501

First ten multiples1,476,701, 2,953,402, 4,430,103, 5,906,804, 7,383,505, 8,860,206, 10,336,907, 11,813,608, 13,290,309, 14,767,010

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached4,430,1043× the starting value

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

First steps1,476,701 → 4,430,104 → 2,215,052 → 1,107,526 → 553,763 → 1,661,290 → 830,645 → 2,491,936 → 1,245,968 → 622,984 → …

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

As a percentage & fraction

As a percentage147,670,100%

1,476,701% as a decimal14,767.01

1,476,701% of 1001,476,701

1,476,701% of 1,00014,767,010

As a fraction of 1001,476,701/100

Read another way

As seconds17 days, 2 hours and 11 minutes

As bytes1.408 MiB

As a 24-bit colour#16885D

Keep nerding

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