Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000011100001011011011010 |
3 | 111020122122220202122101022220 |
4 | 112331322313003201123122 |
5 | 101214440301134134320 |
6 | 554500153523524510 |
7 | 30163612205315415 |
oct | 2675726703413332 |
9 | 436578822571286 |
10 | 101012112021210 |
11 | 2a204aa5945955 |
12 | b3b49a7b29736 |
13 | 444952a838630 |
14 | 1ad3025ab6b7c |
15 | ba2854532e40 |
hex | 5bdeb70e16da |
101012112021210 has 64 divisors (see below), whose sum is σ = 261111412356480. Its totient is φ = 24861286206720.
The previous prime is 101012112021137. The next prime is 101012112021229. The reversal of 101012112021210 is 12120211210101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101012112021210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13838725 + ... + 19837704.
It is an arithmetic number, because the mean of its divisors is an integer number (4079865818070).
Almost surely, 2101012112021210 is an apocalyptic number.
101012112021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101012112021210 is an abundant number, since it is smaller than the sum of its proper divisors (160099300335270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012112021210 is a wasteful number, since it uses less digits than its factorization.
101012112021210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33684143.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101012112021210 its reverse (12120211210101), we get a palindrome (113132323231311).
The spelling of 101012112021210 in words is "one hundred one trillion, twelve billion, one hundred twelve million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •