Base | Representation |
---|---|
bin | 1001001111001000011011… |
… | …10100000101011010000111 |
3 | 2122220201120201101211002102 |
4 | 10213210031310011122013 |
5 | 10130234144304201411 |
6 | 111110445534502315 |
7 | 4164300534156050 |
oct | 447441564053207 |
9 | 78821521354072 |
10 | 20311132100231 |
11 | 65209a2618a75 |
12 | 234052506499b |
13 | b4444050c6ab |
14 | 5030c7a19727 |
15 | 2535149c9d3b |
hex | 12790dd05687 |
20311132100231 has 8 divisors (see below), whose sum is σ = 23212924600320. Its totient is φ = 17409390150168.
The previous prime is 20311132100153. The next prime is 20311132100243. The reversal of 20311132100231 is 13200123111302.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20311132100231 - 242 = 15913085589127 is a prime.
It is a super-2 number, since 2×203111321002312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20311132100131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11772551 + ... + 13387128.
It is an arithmetic number, because the mean of its divisors is an integer number (2901615575040).
Almost surely, 220311132100231 is an apocalyptic number.
20311132100231 is a deficient number, since it is larger than the sum of its proper divisors (2901792500089).
20311132100231 is a wasteful number, since it uses less digits than its factorization.
20311132100231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25275013.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20311132100231 its reverse (13200123111302), we get a palindrome (33511255211533).
The spelling of 20311132100231 in words is "twenty trillion, three hundred eleven billion, one hundred thirty-two million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •