Base | Representation |
---|---|
bin | 1001001100000001010000… |
… | …0110000011100110010001 |
3 | 1022202202021201210102110220 |
4 | 2103000110012003212101 |
5 | 2311003100123241423 |
6 | 33252501334543253 |
7 | 2061565314002220 |
oct | 223002406034621 |
9 | 38682251712426 |
10 | 10102100212113 |
11 | 3245305232608 |
12 | 1171a30b07b29 |
13 | 583815acb510 |
14 | 26cd31092cb7 |
15 | 127ba37379e3 |
hex | 93014183991 |
10102100212113 has 16 divisors (see below), whose sum is σ = 16577805476736. Its totient is φ = 5328580331520.
The previous prime is 10102100212103. The next prime is 10102100212129. The reversal of 10102100212113 is 31121200120101.
It is not a de Polignac number, because 10102100212113 - 29 = 10102100211601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10102100212092 and 10102100212101.
It is not an unprimeable number, because it can be changed into a prime (10102100212103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18502014768 + ... + 18502015313.
It is an arithmetic number, because the mean of its divisors is an integer number (1036112842296).
Almost surely, 210102100212113 is an apocalyptic number.
10102100212113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10102100212113 is a deficient number, since it is larger than the sum of its proper divisors (6475705264623).
10102100212113 is a wasteful number, since it uses less digits than its factorization.
10102100212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37004030104.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10102100212113 its reverse (31121200120101), we get a palindrome (41223300332214).
The spelling of 10102100212113 in words is "ten trillion, one hundred two billion, one hundred million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •