Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …1000010001101000010101 |
3 | 1022202202002012221012221110 |
4 | 2103000033120101220111 |
5 | 2311002414400231401 |
6 | 33252445431205233 |
7 | 2061563333403615 |
oct | 223001730215025 |
9 | 38682065835843 |
10 | 10102021102101 |
11 | 324527460a035 |
12 | 1171a0a516819 |
13 | 5838025c0266 |
14 | 26cd2477ca45 |
15 | 127b9b80c9d6 |
hex | 9300f611a15 |
10102021102101 has 16 divisors (see below), whose sum is σ = 14055394498560. Its totient is φ = 6441681246000.
The previous prime is 10102021102087. The next prime is 10102021102139. The reversal of 10102021102101 is 10120112020101.
It is not a de Polignac number, because 10102021102101 - 26 = 10102021102037 is a prime.
It is a super-2 number, since 2×101020211021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102021102001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 281976 + ... + 4503726.
It is an arithmetic number, because the mean of its divisors is an integer number (878462156160).
Almost surely, 210102021102101 is an apocalyptic number.
It is an amenable number.
10102021102101 is a deficient number, since it is larger than the sum of its proper divisors (3953373396459).
10102021102101 is a wasteful number, since it uses less digits than its factorization.
10102021102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4256456.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10102021102101 its reverse (10120112020101), we get a palindrome (20222133122202).
The spelling of 10102021102101 in words is "ten trillion, one hundred two billion, twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •