Base | Representation |
---|---|
bin | 10111001100011111000001… |
… | …010110101101011011100001 |
3 | 111101012100102012220210101212 |
4 | 113030133001112231123201 |
5 | 101332340122111000413 |
6 | 1000544044132235505 |
7 | 30326124353432015 |
oct | 2714370126553341 |
9 | 441170365823355 |
10 | 102013012203233 |
11 | 2a560525a0792a |
12 | b53697b46bb95 |
13 | 44bca2a462651 |
14 | 1b296558c6545 |
15 | bbd8d4d0eca8 |
hex | 5cc7c15ad6e1 |
102013012203233 has 2 divisors, whose sum is σ = 102013012203234. Its totient is φ = 102013012203232.
The previous prime is 102013012203209. The next prime is 102013012203259. The reversal of 102013012203233 is 332302210310201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58613218229329 + 43399793973904 = 7655927^2 + 6587852^2 .
It is a cyclic number.
It is not a de Polignac number, because 102013012203233 - 242 = 97614965692129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102013012203199 and 102013012203208.
It is not a weakly prime, because it can be changed into another prime (102013012203293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006506101616 + 51006506101617.
It is an arithmetic number, because the mean of its divisors is an integer number (51006506101617).
Almost surely, 2102013012203233 is an apocalyptic number.
It is an amenable number.
102013012203233 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013012203233 is an equidigital number, since it uses as much as digits as its factorization.
102013012203233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102013012203233 its reverse (332302210310201), we get a palindrome (434315222513434).
The spelling of 102013012203233 in words is "one hundred two trillion, thirteen billion, twelve million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •