Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …010111001000101001111101 |
3 | 111101012100102020010110101002 |
4 | 113030133001113020221331 |
5 | 101332340122123032444 |
6 | 1000544044134500045 |
7 | 30326124354405104 |
oct | 2714370127105175 |
9 | 441170366113332 |
10 | 102013012314749 |
11 | 2a560525a83698 |
12 | b53697b504625 |
13 | 44bca2a4a1333 |
14 | 1b2965591503b |
15 | bbd8d4d32d4e |
hex | 5cc7c15c8a7d |
102013012314749 has 2 divisors, whose sum is σ = 102013012314750. Its totient is φ = 102013012314748.
The previous prime is 102013012314721. The next prime is 102013012314781. The reversal of 102013012314749 is 947413210310201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85475109825625 + 16537902489124 = 9245275^2 + 4066682^2 .
It is a cyclic number.
It is not a de Polignac number, because 102013012314749 - 224 = 102012995537533 is a prime.
It is a super-2 number, since 2×1020130123147492 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102013002314749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006506157374 + 51006506157375.
It is an arithmetic number, because the mean of its divisors is an integer number (51006506157375).
Almost surely, 2102013012314749 is an apocalyptic number.
It is an amenable number.
102013012314749 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013012314749 is an equidigital number, since it uses as much as digits as its factorization.
102013012314749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 38.
The spelling of 102013012314749 in words is "one hundred two trillion, thirteen billion, twelve million, three hundred fourteen thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •