Base | Representation |
---|---|
bin | 100110011010… |
… | …100001100011 |
3 | 200221121121020 |
4 | 212122201203 |
5 | 10034220430 |
6 | 555500523 |
7 | 151410636 |
oct | 46324143 |
9 | 20847536 |
10 | 10070115 |
11 | 5758910 |
12 | 3457743 |
13 | 2117763 |
14 | 14a1c1d |
15 | d3db10 |
hex | 99a863 |
10070115 has 16 divisors (see below), whose sum is σ = 17577216. Its totient is φ = 4882400.
The previous prime is 10070087. The next prime is 10070119. The reversal of 10070115 is 51107001.
It is not a de Polignac number, because 10070115 - 27 = 10069987 is a prime.
It is a super-2 number, since 2×100701152 = 202814432226450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 10070094 and 10070103.
It is not an unprimeable number, because it can be changed into a prime (10070119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30351 + ... + 30680.
It is an arithmetic number, because the mean of its divisors is an integer number (1098576).
Almost surely, 210070115 is an apocalyptic number.
10070115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10070115 is a deficient number, since it is larger than the sum of its proper divisors (7507101).
10070115 is a wasteful number, since it uses less digits than its factorization.
10070115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61050.
The product of its (nonzero) digits is 35, while the sum is 15.
The square root of 10070115 is about 3173.3444502606. The cubic root of 10070115 is about 215.9458240330.
Adding to 10070115 its reverse (51107001), we get a palindrome (61177116).
The spelling of 10070115 in words is "ten million, seventy thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •