Recognised as Number
7,115,001
- Positive
- Odd
- Composite
- 7 digits
7,115,001 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value7,115,001
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 47 × 50,461
Distinct prime factors33, 47, 50,461
Number of divisors8
Sum of divisors σ(n)9,688,704
Aliquot sum2,573,703sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,642,320integers below n that share no factor with it
Carmichael function λ(n)1,160,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,642,320
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 47, 141, 50,461, 151,383, 2,371,667, 7,115,0018 in total
Arithmetic
Previous number7,115,000
Next number7,115,002
Double14,230,002
Half3,557,500.5
Square50,623,239,230,001
Cube360,184,397,744,696,345,001
Square root2,667.395921119≈irrational, shown to 9 decimal places
Cube root192.335000007≈
Negation-7,115,001
Reciprocal1.40548118 × 10^-7≈
Representations
Decimal7,115,001
Binary1101100100100001111100123 bits
Octal33110371
Hexadecimal6C90F9
Base 3648HYX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one hundred and fifteen thousand and one
Ordinalseven million, one hundred and fifteen thousand and first
Scientific notation7.115001 × 10^6
Engineering notation7.115001 × 10^6
In other bases
Ternary111101110221120base 3; the most digit-efficient integer base after e: 15 digits
Quinary3310140001base 5; one hand: 10 digits
Septenary114322305base 7: 9 digits
Nonary14343846base 9; each digit is two ternary digits: 8 digits
Duodecimal2471589base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2497a1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:56:23:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110111100TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111011001000100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011001001000011111001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; 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 90 f9
Gray code10110101101100010000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011001001000011111001
64-bit0000000000000000000000000000000000000000011011001001000011111001
One's complement11111111100100110110111100000110at 32 bits, every bit flipped
Bits reversed10011111000010010011011000000000at 32 bits
Rotated left by 100000000110110010010000111110010at 32 bits, wrapping
Shifted left by 1110110010010000111110010= 14,230,002, no wrap
Shifted right by 11101100100100001111100= 3,557,500, discarding the low bit
These bits as a double3.51527756 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,115,001 to the power 250,623,239,230,001
7,115,001 to the power 3360,184,397,744,696,345,001
7,115,001 to the power 42,562,712,350,137,912,239,378,460,001
7,115,001 to the power 518,233,700,933,943,595,721,089,982,285,575,001
First ten multiples7,115,001, 14,230,002, 21,345,003, 28,460,004, 35,575,005, 42,690,006, 49,805,007, 56,920,008, 64,035,009, 71,150,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached623,827,16887× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,115,001 → 21,345,004 → 10,672,502 → 5,336,251 → 16,008,754 → 8,004,377 → 24,013,132 → 12,006,566 → 6,003,283 → 18,009,850 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage711,500,100%
7,115,001% as a decimal71,150.01
7,115,001% of 1007,115,001
7,115,001% of 1,00071,150,010
As a fraction of 1007,115,001/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,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page