Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …011100000101110001000101 |
3 | 111101012011111000200011112211 |
4 | 113030131033130011301011 |
5 | 101332322213324323023 |
6 | 1000543130340543421 |
7 | 30326026115526025 |
oct | 2714351734056105 |
9 | 441164430604484 |
10 | 102011101011013 |
11 | 2a55a735107927 |
12 | b5365273b1b71 |
13 | 44bc7b451068c |
14 | 1b29513b47a85 |
15 | bbd822140a0d |
hex | 5cc74f705c45 |
102011101011013 has 2 divisors, whose sum is σ = 102011101011014. Its totient is φ = 102011101011012.
The previous prime is 102011101010989. The next prime is 102011101011019. The reversal of 102011101011013 is 310110101110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99582496684609 + 2428604326404 = 9979103^2 + 1558398^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102011101011013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102011101010984 and 102011101011002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011101011019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005550505506 + 51005550505507.
It is an arithmetic number, because the mean of its divisors is an integer number (51005550505507).
Almost surely, 2102011101011013 is an apocalyptic number.
It is an amenable number.
102011101011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011101011013 is an equidigital number, since it uses as much as digits as its factorization.
102011101011013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 102011101011013 its reverse (310110101110201), we get a palindrome (412121202121214).
The spelling of 102011101011013 in words is "one hundred two trillion, eleven billion, one hundred one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •