Base | Representation |
---|---|
bin | 1001010001101101111101… |
… | …1011111110000110000101 |
3 | 1100010002222121102100200000 |
4 | 2110123133123332012011 |
5 | 2314104100224341401 |
6 | 33405452112511513 |
7 | 2101632351035115 |
oct | 224333733760605 |
9 | 40102877370600 |
10 | 10200001012101 |
11 | 328288372666a |
12 | 11889b384b599 |
13 | 58cb18740274 |
14 | 27397b3d5045 |
15 | 12a4d3517186 |
hex | 946df6fe185 |
10200001012101 has 24 divisors (see below), whose sum is σ = 15279167371104. Its totient is φ = 6799932354960.
The previous prime is 10200001012093. The next prime is 10200001012139. The reversal of 10200001012101 is 10121010000201.
It is a happy number.
It is not a de Polignac number, because 10200001012101 - 23 = 10200001012093 is a prime.
It is a super-2 number, since 2×102000010121012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200001013101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38988010 + ... + 39248756.
It is an arithmetic number, because the mean of its divisors is an integer number (636631973796).
Almost surely, 210200001012101 is an apocalyptic number.
It is an amenable number.
10200001012101 is a deficient number, since it is larger than the sum of its proper divisors (5079166359003).
10200001012101 is an equidigital number, since it uses as much as digits as its factorization.
10200001012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421743 (or 421731 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200001012101 its reverse (10121010000201), we get a palindrome (20321011012302).
The spelling of 10200001012101 in words is "ten trillion, two hundred billion, one million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •