Base | Representation |
---|---|
bin | 10111001101111010011101… |
… | …110100010001001101110111 |
3 | 111101112201212002222211222022 |
4 | 113031322131310101031313 |
5 | 101340442214224020043 |
6 | 1001101123210223355 |
7 | 30336201506003441 |
oct | 2715723564211567 |
9 | 441481762884868 |
10 | 102111200220023 |
11 | 2a599131544145 |
12 | b551a02424b5b |
13 | 44c9077747877 |
14 | 1b302cc031491 |
15 | bc122ee25868 |
hex | 5cde9dd11377 |
102111200220023 has 2 divisors, whose sum is σ = 102111200220024. Its totient is φ = 102111200220022.
The previous prime is 102111200219983. The next prime is 102111200220031. The reversal of 102111200220023 is 320022002111201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102111200220023 - 216 = 102111200154487 is a prime.
It is a super-2 number, since 2×1021112002200232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102111200219983 and 102111200220010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102111200222023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055600110011 + 51055600110012.
It is an arithmetic number, because the mean of its divisors is an integer number (51055600110012).
Almost surely, 2102111200220023 is an apocalyptic number.
102111200220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
102111200220023 is an equidigital number, since it uses as much as digits as its factorization.
102111200220023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102111200220023 its reverse (320022002111201), we get a palindrome (422133202331224).
The spelling of 102111200220023 in words is "one hundred two trillion, one hundred eleven billion, two hundred million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •