Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0100101001101010100100 |
3 | 1100010022122221021120000120 |
4 | 2110131202210221222210 |
5 | 2314123101440244022 |
6 | 33410454304241540 |
7 | 2102041024353252 |
oct | 224354244515244 |
9 | 40108587246016 |
10 | 10202201103012 |
11 | 3283802608516 |
12 | 11893086102b0 |
13 | 5900a94a40c9 |
14 | 273b096975d2 |
15 | 12a5b1750d5c |
hex | 94762929aa4 |
10202201103012 has 24 divisors (see below), whose sum is σ = 23808586620000. Its totient is φ = 3400240742016.
The previous prime is 10202201102993. The next prime is 10202201103041. The reversal of 10202201103012 is 21030110220201.
It is a junction number, because it is equal to n+sod(n) for n = 10202201102982 and 10202201103000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61533637 + ... + 61699212.
It is an arithmetic number, because the mean of its divisors is an integer number (992024442500).
Almost surely, 210202201103012 is an apocalyptic number.
10202201103012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10202201103012 is an abundant number, since it is smaller than the sum of its proper divisors (13606385516988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202201103012 is a wasteful number, since it uses less digits than its factorization.
10202201103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123239755 (or 123239753 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10202201103012 its reverse (21030110220201), we get a palindrome (31232311323213).
The spelling of 10202201103012 in words is "ten trillion, two hundred two billion, two hundred one million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •