Recognised as Number

1,016,947

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,016,947

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,016,947

Distinct prime factors11,016,947

Number of divisors2

Sum of divisors σ(n)1,016,948

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,016,946the 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,016,9472 in total

Arithmetic

Previous number1,016,946

Next number1,016,948

Double2,033,894

Half508,473.5

Square1,034,181,200,809

Cube1,051,707,469,619,110,123

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

Cube root100.561738589≈

Negation-1,016,947

Reciprocal9.83335415 × 10^-7≈

Representations

Decimal1,016,947

Binary1111100001000111001120 bits

Octal3702163

HexadecimalF8473

Base 36LSOJ

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

In wordsone million, sixteen thousand, nine hundred and forty-seven

Ordinalone million, sixteen thousand, nine hundred and forty-seventh

Scientific notation1.016947 × 10^6

Engineering notation1.016947 × 10^6

In other bases

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

Quinary230020242base 5; one hand: 9 digits

Septenary11433601base 7: 8 digits

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

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

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

Sexagesimal4:42:29:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011111000010001110011

Bit length20 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits9within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 19worth 524,288

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes30f 84 73

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

At each machine width

32-bit00000000000011111000010001110011

64-bit0000000000000000000000000000000000000000000011111000010001110011

One's complement11111111111100000111101110001100at 32 bits, every bit flipped

Bits reversed11001110001000011111000000000000at 32 bits

Rotated left by 100000000000111110000100011100110at 32 bits, wrapping

Shifted left by 1111110000100011100110= 2,033,894, no wrap

Shifted right by 11111100001000111001= 508,473, discarding the low bit

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

Nearest landmarks

Next prime1,016,959+12

Previous prime1,016,941−6

Distance to nearest prime0, it is prime

Nearest square below1,016,064

Nearest square above1,018,081

Powers & multiples

1,016,947 to the power 21,034,181,200,809

1,016,947 to the power 31,051,707,469,619,110,123

1,016,947 to the power 41,069,530,756,106,745,182,254,481

1,016,947 to the power 51,087,656,093,830,486,192,858,147,689,507

First ten multiples1,016,947, 2,033,894, 3,050,841, 4,067,788, 5,084,735, 6,101,682, 7,118,629, 8,135,576, 9,152,523, 10,169,470

Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 7

Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 1121the total stopping time

Highest value reached4,576,2644× the starting value

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

First steps1,016,947 → 3,050,842 → 1,525,421 → 4,576,264 → 2,288,132 → 1,144,066 → 572,033 → 1,716,100 → 858,050 → 429,025 → …

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

As a percentage & fraction

As a percentage101,694,700%

1,016,947% as a decimal10,169.47

1,016,947% of 1001,016,947

1,016,947% of 1,00010,169,470

As a fraction of 1001,016,947/100

Read another way

As seconds11 days, 18 hours and 29 minutes

As bytes993.112 KiB

As a 24-bit colour#0F8473

Keep nerding

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