Base | Representation |
---|---|
bin | 1001001111100000011011… |
… | …0001110011010110010111 |
3 | 1022222110220200202002021210 |
4 | 2103320012301303112113 |
5 | 2312443242110403030 |
6 | 33340210011112503 |
7 | 2066115663462234 |
oct | 223700661632627 |
9 | 38873820662253 |
10 | 10162006341015 |
11 | 3268756724951 |
12 | 118156b442733 |
13 | 589371c7c779 |
14 | 271bb52ac78b |
15 | 12950cae6bb0 |
hex | 93e06c73597 |
10162006341015 has 64 divisors (see below), whose sum is σ = 16485500287872. Its totient is φ = 5344827801600.
The previous prime is 10162006341007. The next prime is 10162006341017. The reversal of 10162006341015 is 51014360026101.
It is a happy number.
It is not a de Polignac number, because 10162006341015 - 23 = 10162006341007 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10162006341017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 497128195 + ... + 497148635.
It is an arithmetic number, because the mean of its divisors is an integer number (257585941998).
Almost surely, 210162006341015 is an apocalyptic number.
10162006341015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10162006341015 is a deficient number, since it is larger than the sum of its proper divisors (6323493946857).
10162006341015 is a wasteful number, since it uses less digits than its factorization.
10162006341015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22020.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 10162006341015 its reverse (51014360026101), we get a palindrome (61176366367116).
The spelling of 10162006341015 in words is "ten trillion, one hundred sixty-two billion, six million, three hundred forty-one thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •