Base | Representation |
---|---|
bin | 10111010000110110101101… |
… | …110111101101100011101111 |
3 | 111102021001121002112001021012 |
4 | 113100312231313231203233 |
5 | 101402300201223132121 |
6 | 1001334032445455435 |
7 | 30356615525320025 |
oct | 2720665567554357 |
9 | 442231532461235 |
10 | 102313333020911 |
11 | 2a666928207201 |
12 | b58501427157b |
13 | 451214b89a6ac |
14 | 1b39dc549a715 |
15 | bc6610740c5b |
hex | 5d0dadded8ef |
102313333020911 has 2 divisors, whose sum is σ = 102313333020912. Its totient is φ = 102313333020910.
The previous prime is 102313333020893. The next prime is 102313333021019. The reversal of 102313333020911 is 119020333313201.
Together with next prime (102313333021019) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (119020333313201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102313333020911 - 222 = 102313328826607 is a prime.
It is a super-2 number, since 2×1023133330209112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102313333020011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51156666510455 + 51156666510456.
It is an arithmetic number, because the mean of its divisors is an integer number (51156666510456).
Almost surely, 2102313333020911 is an apocalyptic number.
102313333020911 is a deficient number, since it is larger than the sum of its proper divisors (1).
102313333020911 is an equidigital number, since it uses as much as digits as its factorization.
102313333020911 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 32.
The spelling of 102313333020911 in words is "one hundred two trillion, three hundred thirteen billion, three hundred thirty-three million, twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •