Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0100101011111000100111 |
3 | 1100010022122221022000111021 |
4 | 2110131202210223320213 |
5 | 2314123101441041403 |
6 | 33410454304352011 |
7 | 2102041024421620 |
oct | 224354244537047 |
9 | 40108587260437 |
10 | 10202201112103 |
11 | 3283802614330 |
12 | 1189308615607 |
13 | 5900a94a82a0 |
14 | 273b0969aa47 |
15 | 12a5b17538bd |
hex | 9476292be27 |
10202201112103 has 32 divisors (see below), whose sum is σ = 13930230827520. Its totient is φ = 7213869452160.
The previous prime is 10202201112071. The next prime is 10202201112137. The reversal of 10202201112103 is 30121110220201.
10202201112103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10202201112103 - 25 = 10202201112071 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202201112163) 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, 86313900 + ... + 86432017.
It is an arithmetic number, because the mean of its divisors is an integer number (435319713360).
Almost surely, 210202201112103 is an apocalyptic number.
10202201112103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10202201112103 is a deficient number, since it is larger than the sum of its proper divisors (3728029715417).
10202201112103 is a wasteful number, since it uses less digits than its factorization.
10202201112103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172746007.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10202201112103 its reverse (30121110220201), we get a palindrome (40323311332304).
The spelling of 10202201112103 in words is "ten trillion, two hundred two billion, two hundred one million, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •