Recognised as Number
7,115,011
- Positive
- Odd
- Prime
- 7 digits
7,115,011 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 value7,115,011
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 factorisation7,115,011
Distinct prime factors17,115,011
Number of divisors2
Sum of divisors σ(n)7,115,012
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,115,010integers below n that share no factor with it
Carmichael function λ(n)7,115,010the 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, 7,115,0112 in total
Arithmetic
Previous number7,115,010
Next number7,115,012
Double14,230,022
Half3,557,505.5
Square50,623,381,530,121
Cube360,185,916,444,007,746,331
Square root2,667.397795605≈irrational, shown to 9 decimal places
Cube root192.335090115≈
Negation-7,115,011
Reciprocal1.4054792 × 10^-7≈
Representations
Decimal7,115,011
Binary1101100100100010000001123 bits
Octal33110403
Hexadecimal6C9103
Base 3648HZ7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one hundred and fifteen thousand and eleven
Ordinalseven million, one hundred and fifteen thousand and eleventh
Scientific notation7.115011 × 10^6
Engineering notation7.115011 × 10^6
In other bases
Ternary111101110221221base 3; the most digit-efficient integer base after e: 15 digits
Quinary3310140021base 5; one hand: 10 digits
Septenary114322321base 7: 9 digits
Nonary14343857base 9; each digit is two ternary digits: 8 digits
Duodecimal2471597base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2497abbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:56:23:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110111100T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111011001000100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011001001000100000011
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36c 91 03
Gray code10110101101100110000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011001001000100000011
64-bit0000000000000000000000000000000000000000011011001001000100000011
One's complement11111111100100110110111011111100at 32 bits, every bit flipped
Bits reversed11000000100010010011011000000000at 32 bits
Rotated left by 100000000110110010010001000000110at 32 bits, wrapping
Shifted left by 1110110010010001000000110= 14,230,022, no wrap
Shifted right by 11101100100100010000001= 3,557,505, discarding the low bit
These bits as a double3.5152825 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,115,011 to the power 250,623,381,530,121
7,115,011 to the power 3360,185,916,444,007,746,331
7,115,011 to the power 42,562,726,757,544,195,999,230,274,641
7,115,011 to the power 518,233,829,069,921,287,520,679,395,603,736,051
First ten multiples7,115,011, 14,230,022, 21,345,033, 28,460,044, 35,575,055, 42,690,066, 49,805,077, 56,920,088, 64,035,099, 71,150,110
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached32,017,5524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,115,011 → 21,345,034 → 10,672,517 → 32,017,552 → 16,008,776 → 8,004,388 → 4,002,194 → 2,001,097 → 6,003,292 → 3,001,646 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage711,501,100%
7,115,011% as a decimal71,150.11
7,115,011% of 1007,115,011
7,115,011% of 1,00071,150,110
As a fraction of 1007,115,011/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 7,115,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page