Base | Representation |
---|---|
bin | 10111001100100111100101… |
… | …100101111100011011111111 |
3 | 111101020020011020101221011001 |
4 | 113030213211211330123333 |
5 | 101333012441242024411 |
6 | 1000552204543311131 |
7 | 30326601321365224 |
oct | 2714474545743377 |
9 | 441206136357131 |
10 | 102022210111231 |
11 | 2a564415992293 |
12 | b5387078ab4a7 |
13 | 44c0864c16967 |
14 | 1b29c892d794b |
15 | bbdc72580dc1 |
hex | 5cc9e597c6ff |
102022210111231 has 2 divisors, whose sum is σ = 102022210111232. Its totient is φ = 102022210111230.
The previous prime is 102022210111127. The next prime is 102022210111243. The reversal of 102022210111231 is 132111012220201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102022210111231 - 221 = 102022208014079 is a prime.
It is a super-2 number, since 2×1020222101112312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102022210111199 and 102022210111208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102022210111331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51011105055615 + 51011105055616.
It is an arithmetic number, because the mean of its divisors is an integer number (51011105055616).
Almost surely, 2102022210111231 is an apocalyptic number.
102022210111231 is a deficient number, since it is larger than the sum of its proper divisors (1).
102022210111231 is an equidigital number, since it uses as much as digits as its factorization.
102022210111231 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 19.
Adding to 102022210111231 its reverse (132111012220201), we get a palindrome (234133222331432).
The spelling of 102022210111231 in words is "one hundred two trillion, twenty-two billion, two hundred ten million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •