Base | Representation |
---|---|
bin | 10111001100011111010100… |
… | …011011110010110111100011 |
3 | 111101012101020112020120012001 |
4 | 113030133110123302313203 |
5 | 101332341301032201311 |
6 | 1000544140005144431 |
7 | 30326135321305321 |
oct | 2714372433626743 |
9 | 441171215216161 |
10 | 102013332303331 |
11 | 2a56067a66a869 |
12 | b536a4a6bb117 |
13 | 44bca7b87a2a7 |
14 | 1b2968620cd11 |
15 | bbd902e8e4c1 |
hex | 5cc7d46f2de3 |
102013332303331 has 2 divisors, whose sum is σ = 102013332303332. Its totient is φ = 102013332303330.
The previous prime is 102013332303319. The next prime is 102013332303349. The reversal of 102013332303331 is 133303233310201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102013332303331 - 219 = 102013331779043 is a prime.
It is a super-2 number, since 2×1020133323033312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102013332303331.
It is not a weakly prime, because it can be changed into another prime (102013332303731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006666151665 + 51006666151666.
It is an arithmetic number, because the mean of its divisors is an integer number (51006666151666).
Almost surely, 2102013332303331 is an apocalyptic number.
102013332303331 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013332303331 is an equidigital number, since it uses as much as digits as its factorization.
102013332303331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 102013332303331 its reverse (133303233310201), we get a palindrome (235316565613532).
The spelling of 102013332303331 in words is "one hundred two trillion, thirteen billion, three hundred thirty-two million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •