Base | Representation |
---|---|
bin | 10111001101111011011001… |
… | …011101111110101111000001 |
3 | 111101112211102212011020212221 |
4 | 113031323121131332233001 |
5 | 101341001241424310423 |
6 | 1001101410400451041 |
7 | 30336235350405010 |
oct | 2715733135765701 |
9 | 441484385136787 |
10 | 102112201010113 |
11 | 2a5995a5457598 |
12 | b552041619a81 |
13 | 44c91a6ba0558 |
14 | 1b30384d06a77 |
15 | bc128cc10e5d |
hex | 5cded977ebc1 |
102112201010113 has 4 divisors (see below), whose sum is σ = 116699658297280. Its totient is φ = 87524743722948.
The previous prime is 102112201010101. The next prime is 102112201010137. The reversal of 102112201010113 is 311010102211201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 102112201010113 - 29 = 102112201009601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102112201010153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7293728643573 + ... + 7293728643586.
It is an arithmetic number, because the mean of its divisors is an integer number (29174914574320).
Almost surely, 2102112201010113 is an apocalyptic number.
It is an amenable number.
102112201010113 is a deficient number, since it is larger than the sum of its proper divisors (14587457287167).
102112201010113 is an equidigital number, since it uses as much as digits as its factorization.
102112201010113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14587457287166.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 102112201010113 its reverse (311010102211201), we get a palindrome (413122303221314).
The spelling of 102112201010113 in words is "one hundred two trillion, one hundred twelve billion, two hundred one million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •