Base | Representation |
---|---|
bin | 1001011000001000110111… |
… | …1011001110110101010010 |
3 | 1100111122200201100212022010 |
4 | 2112002031323032311102 |
5 | 2322410444433000411 |
6 | 33532253155123350 |
7 | 2112615624213561 |
oct | 226021573166522 |
9 | 40448621325263 |
10 | 10310302625106 |
11 | 3315636052020 |
12 | 11a62575a3556 |
13 | 59a3465811b3 |
14 | 27904268bbd8 |
15 | 12d2dbd3b7a6 |
hex | 9608deced52 |
10310302625106 has 16 divisors (see below), whose sum is σ = 22495205727648. Its totient is φ = 3124334128800.
The previous prime is 10310302625047. The next prime is 10310302625107. The reversal of 10310302625106 is 60152620301301.
10310302625106 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103103026251062 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10310302625107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78108353155 + ... + 78108353286.
It is an arithmetic number, because the mean of its divisors is an integer number (1405950357978).
Almost surely, 210310302625106 is an apocalyptic number.
10310302625106 is an abundant number, since it is smaller than the sum of its proper divisors (12184903102542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310302625106 is a wasteful number, since it uses less digits than its factorization.
10310302625106 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156216706457.
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 10310302625106 its reverse (60152620301301), we get a palindrome (70462922926407).
The spelling of 10310302625106 in words is "ten trillion, three hundred ten billion, three hundred two million, six hundred twenty-five thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •