Base | Representation |
---|---|
bin | 101110000000000001111100… |
… | …000000110110110110010111 |
3 | 222112022212012110200212002211 |
4 | 232000001330000312312113 |
5 | 203004140411322011411 |
6 | 1554140541215014251 |
7 | 60420401262054610 |
oct | 5600017400666627 |
9 | 875285173625084 |
10 | 202312220110231 |
11 | 59510148a90090 |
12 | 1a83556920a387 |
13 | 88b6c642922ba |
14 | 37d5d6c56cc07 |
15 | 185c912479221 |
hex | b8007c036d97 |
202312220110231 has 32 divisors (see below), whose sum is σ = 265516488414720. Its totient is φ = 149344443100800.
The previous prime is 202312220110223. The next prime is 202312220110279. The reversal of 202312220110231 is 132011022213202.
It is a cyclic number.
It is not a de Polignac number, because 202312220110231 - 23 = 202312220110223 is a prime.
It is a super-2 number, since 2×2023122201102312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202312220150231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49407241 + ... + 53345101.
It is an arithmetic number, because the mean of its divisors is an integer number (8297390262960).
Almost surely, 2202312220110231 is an apocalyptic number.
202312220110231 is a deficient number, since it is larger than the sum of its proper divisors (63204268304489).
202312220110231 is a wasteful number, since it uses less digits than its factorization.
202312220110231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3973015.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 202312220110231 its reverse (132011022213202), we get a palindrome (334323242323433).
The spelling of 202312220110231 in words is "two hundred two trillion, three hundred twelve billion, two hundred twenty million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •