Base | Representation |
---|---|
bin | 10010101110000111… |
… | …101110011111110111 |
3 | 1220212212211012211212 |
4 | 102232013232133313 |
5 | 312131342131411 |
6 | 13122340552035 |
7 | 1311060534140 |
oct | 225607563767 |
9 | 56785735755 |
10 | 20101130231 |
11 | 8585622726 |
12 | 3a8b9b261b |
13 | 1b84625a00 |
14 | d898ccac7 |
15 | 7c9a9568b |
hex | 4ae1ee7f7 |
20101130231 has 12 divisors (see below), whose sum is σ = 24875787312. Its totient is φ = 15904190016.
The previous prime is 20101130213. The next prime is 20101130233. The reversal of 20101130231 is 13203110102.
It is not a de Polignac number, because 20101130231 - 210 = 20101129207 is a prime.
It is a super-2 number, since 2×201011302312 (a number of 21 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 (20101130233) 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 in 11 ways as a sum of consecutive naturals, for example, 8494646 + ... + 8497011.
It is an arithmetic number, because the mean of its divisors is an integer number (2072982276).
Almost surely, 220101130231 is an apocalyptic number.
20101130231 is a deficient number, since it is larger than the sum of its proper divisors (4774657081).
20101130231 is a wasteful number, since it uses less digits than its factorization.
20101130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16991690 (or 16991677 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20101130231 its reverse (13203110102), we get a palindrome (33304240333).
The spelling of 20101130231 in words is "twenty billion, one hundred one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •