Base | Representation |
---|---|
bin | 10010101110001111… |
… | …010111010001000111 |
3 | 1220220000120221002000 |
4 | 102232033113101013 |
5 | 312132400212411 |
6 | 13122451520343 |
7 | 1311113542650 |
oct | 225617272107 |
9 | 56800527060 |
10 | 20103132231 |
11 | 858676a876 |
12 | 3a905b90b3 |
13 | 1b84b77020 |
14 | d89c90527 |
15 | 7c9d3d956 |
hex | 4ae3d7447 |
20103132231 has 32 divisors (see below), whose sum is σ = 36655288320. Its totient is φ = 10603848672.
The previous prime is 20103132169. The next prime is 20103132239. The reversal of 20103132231 is 13223130102.
It is not a de Polignac number, because 20103132231 - 27 = 20103132103 is a prime.
It is a super-2 number, since 2×201031322312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20103132239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4088535 + ... + 4093448.
It is an arithmetic number, because the mean of its divisors is an integer number (1145477760).
Almost surely, 220103132231 is an apocalyptic number.
20103132231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20103132231 is a deficient number, since it is larger than the sum of its proper divisors (16552156089).
20103132231 is a wasteful number, since it uses less digits than its factorization.
20103132231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8182012 (or 8182006 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 20103132231 its reverse (13223130102), we get a palindrome (33326262333).
The spelling of 20103132231 in words is "twenty billion, one hundred three million, one hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •