Base | Representation |
---|---|
bin | 1001001001111011011000… |
… | …11100000011100100011011 |
3 | 2122021122001202121100022112 |
4 | 10210331230130003210123 |
5 | 10114322003214312311 |
6 | 110452355402542535 |
7 | 4145340634034501 |
oct | 444755434034433 |
9 | 78248052540275 |
10 | 20132331010331 |
11 | 646208a008791 |
12 | 2311944b07a4b |
13 | b3061709a507 |
14 | 4d85a5148671 |
15 | 24da4c69428b |
hex | 124f6c70391b |
20132331010331 has 16 divisors (see below), whose sum is σ = 20519294140800. Its totient is φ = 19747950552000.
The previous prime is 20132331010283. The next prime is 20132331010333. The reversal of 20132331010331 is 13301013323102.
It is a cyclic number.
It is not a de Polignac number, because 20132331010331 - 222 = 20132326816027 is a prime.
It is a super-2 number, since 2×201323310103312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20132331010297 and 20132331010306.
It is not an unprimeable number, because it can be changed into a prime (20132331010333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68786855 + ... + 69078911.
It is an arithmetic number, because the mean of its divisors is an integer number (1282455883800).
Almost surely, 220132331010331 is an apocalyptic number.
20132331010331 is a deficient number, since it is larger than the sum of its proper divisors (386963130469).
20132331010331 is a wasteful number, since it uses less digits than its factorization.
20132331010331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296474.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 20132331010331 its reverse (13301013323102), we get a palindrome (33433344333433).
The spelling of 20132331010331 in words is "twenty trillion, one hundred thirty-two billion, three hundred thirty-one million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •