Base | Representation |
---|---|
bin | 1001001111101111100000… |
… | …01100111000010011000011 |
3 | 2122222201201201020122102102 |
4 | 10213313300030320103003 |
5 | 10131110130142321011 |
6 | 111124235322341015 |
7 | 4165642433326655 |
oct | 447676014702303 |
9 | 78881651218372 |
10 | 20332110120131 |
11 | 65298881188a7 |
12 | 23445ba65a76b |
13 | b464046c9a14 |
14 | 504117b6a6d5 |
15 | 253d4153473b |
hex | 127df03384c3 |
20332110120131 has 4 divisors (see below), whose sum is σ = 20332131145752. Its totient is φ = 20332089094512.
The previous prime is 20332110120103. The next prime is 20332110120149. The reversal of 20332110120131 is 13102101123302.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20332110120131 - 242 = 15934063609027 is a prime.
It is a super-2 number, since 2×203321101201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20332110120151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8988626 + ... + 11020871.
It is an arithmetic number, because the mean of its divisors is an integer number (5083032786438).
Almost surely, 220332110120131 is an apocalyptic number.
20332110120131 is a deficient number, since it is larger than the sum of its proper divisors (21025621).
20332110120131 is a wasteful number, since it uses less digits than its factorization.
20332110120131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21025620.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20332110120131 its reverse (13102101123302), we get a palindrome (33434211243433).
The spelling of 20332110120131 in words is "twenty trillion, three hundred thirty-two billion, one hundred ten million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •