Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …0000010111111110100001 |
3 | 1022211110111012102111001102 |
4 | 2103100333000113332201 |
5 | 2311301230000342233 |
6 | 33305021441444145 |
7 | 2063101014540251 |
oct | 223207700277641 |
9 | 38743435374042 |
10 | 10120000012193 |
11 | 32519601a7315 |
12 | 11753a7640655 |
13 | 5854093482b6 |
14 | 26db4c479961 |
15 | 12839edec1e8 |
hex | 9343f017fa1 |
10120000012193 has 2 divisors, whose sum is σ = 10120000012194. Its totient is φ = 10120000012192.
The previous prime is 10120000012159. The next prime is 10120000012217. The reversal of 10120000012193 is 39121000002101.
10120000012193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5826782860129 + 4293217152064 = 2413873^2 + 2072008^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120000012193 - 210 = 10120000011169 is a prime.
It is not a weakly prime, because it can be changed into another prime (10120002012193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060000006096 + 5060000006097.
It is an arithmetic number, because the mean of its divisors is an integer number (5060000006097).
Almost surely, 210120000012193 is an apocalyptic number.
It is an amenable number.
10120000012193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120000012193 is an equidigital number, since it uses as much as digits as its factorization.
10120000012193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10120000012193 its reverse (39121000002101), we get a palindrome (49241000014294).
The spelling of 10120000012193 in words is "ten trillion, one hundred twenty billion, twelve thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •