Base | Representation |
---|---|
bin | 10010110110011011… |
… | …11000110110111111 |
3 | 222010022010121110120 |
4 | 21123031320312333 |
5 | 131211244131030 |
6 | 4352121110023 |
7 | 505535101455 |
oct | 113315706677 |
9 | 28108117416 |
10 | 10120302015 |
11 | 432371276a |
12 | 1b65328313 |
13 | c538bb9b5 |
14 | 6c011a9d5 |
15 | 3e3723010 |
hex | 25b378dbf |
10120302015 has 32 divisors (see below), whose sum is σ = 16442528256. Its totient is φ = 5314350720.
The previous prime is 10120302007. The next prime is 10120302019. The reversal of 10120302015 is 51020302101.
10120302015 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10120302015 - 23 = 10120302007 is a prime.
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 = 10120301985 and 10120302003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120302019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 842844 + ... + 854766.
It is an arithmetic number, because the mean of its divisors is an integer number (513829008).
Almost surely, 210120302015 is an apocalyptic number.
10120302015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10120302015 is a deficient number, since it is larger than the sum of its proper divisors (6322226241).
10120302015 is a wasteful number, since it uses less digits than its factorization.
10120302015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12799.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 10120302015 its reverse (51020302101), we get a palindrome (61140604116).
The spelling of 10120302015 in words is "ten billion, one hundred twenty million, three hundred two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •