Base | Representation |
---|---|
bin | 10111001100100101100010… |
… | …011110000001101011000111 |
3 | 111101020000110220220220000121 |
4 | 113030211202132001223013 |
5 | 101332443440104021411 |
6 | 1000551202400122411 |
7 | 30326462646541645 |
oct | 2714454236015307 |
9 | 441200426826017 |
10 | 102020010220231 |
11 | 2a563497127654 |
12 | b5381b3006407 |
13 | 44c05a4222acc |
14 | 1b29b1b088195 |
15 | bbdb94386571 |
hex | 5cc962781ac7 |
102020010220231 has 2 divisors, whose sum is σ = 102020010220232. Its totient is φ = 102020010220230.
The previous prime is 102020010220211. The next prime is 102020010220237. The reversal of 102020010220231 is 132022010020201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102020010220231 - 25 = 102020010220199 is a prime.
It is a super-2 number, since 2×1020200102202312 (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 (102020010220237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010005110115 + 51010005110116.
It is an arithmetic number, because the mean of its divisors is an integer number (51010005110116).
Almost surely, 2102020010220231 is an apocalyptic number.
102020010220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
102020010220231 is an equidigital number, since it uses as much as digits as its factorization.
102020010220231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 102020010220231 its reverse (132022010020201), we get a palindrome (234042020240432).
The spelling of 102020010220231 in words is "one hundred two trillion, twenty billion, ten million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •