Recognised as Number

1,115,701

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,115,701

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,115,701

Distinct prime factors11,115,701

Number of divisors2

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

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number1,115,700

Next number1,115,702

Double2,231,402

Half557,850.5

Square1,244,788,721,401

Cube1,388,812,021,255,817,101

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

Cube root103.716839453≈

Negation-1,115,701

Reciprocal8.96297485 × 10^-7≈

Representations

Decimal1,115,701

Binary10001000001100011010121 bits

Octal4203065

Hexadecimal110635

Base 36NWVP

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

In wordsone million, one hundred and fifteen thousand, seven hundred and one

Ordinalone million, one hundred and fifteen thousand, seven hundred and first

Scientific notation1.115701 × 10^6

Engineering notation1.115701 × 10^6

In other bases

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

Quinary241200301base 5; one hand: 9 digits

Septenary12324526base 7: 8 digits

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

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

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

Sexagesimal5:9:55:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100010000011000110101

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

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

Bytes311 06 35

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

At each machine width

32-bit00000000000100010000011000110101

64-bit0000000000000000000000000000000000000000000100010000011000110101

One's complement11111111111011101111100111001010at 32 bits, every bit flipped

Bits reversed10101100011000001000100000000000at 32 bits

Rotated left by 100000000001000100000110001101010at 32 bits, wrapping

Shifted left by 11000100000110001101010= 2,231,402, no wrap

Shifted right by 110001000001100011010= 557,850, discarding the low bit

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

Nearest landmarks

Next prime1,115,711+10

Previous prime1,115,683−18

Distance to nearest prime0, it is prime

Nearest square below1,115,136

Nearest square above1,117,249

Powers & multiples

1,115,701 to the power 21,244,788,721,401

1,115,701 to the power 31,388,812,021,255,817,101

1,115,701 to the power 41,549,498,960,927,136,395,402,801

1,115,701 to the power 51,728,777,540,205,367,003,487,300,478,501

First ten multiples1,115,701, 2,231,402, 3,347,103, 4,462,804, 5,578,505, 6,694,206, 7,809,907, 8,925,608, 10,041,309, 11,157,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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached3,347,1043× the starting value

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

First steps1,115,701 → 3,347,104 → 1,673,552 → 836,776 → 418,388 → 209,194 → 104,597 → 313,792 → 156,896 → 78,448 → …

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

As a percentage & fraction

As a percentage111,570,100%

1,115,701% as a decimal11,157.01

1,115,701% of 1001,115,701

1,115,701% of 1,00011,157,010

As a fraction of 1001,115,701/100

Read another way

As seconds12 days, 21 hours and 55 minutes

As bytes1.064 MiB

As a 24-bit colour#110635

Keep nerding

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