Base | Representation |
---|---|
bin | 1001001001111011001001… |
… | …10000000000010110111011 |
3 | 2122021121201202220002001012 |
4 | 10210331210300000112323 |
5 | 10114321222204203311 |
6 | 110452334514144135 |
7 | 4145334506460260 |
oct | 444754460002673 |
9 | 78247652802035 |
10 | 20132202022331 |
11 | 6462023218133 |
12 | 231190988204b |
13 | b305c6447559 |
14 | 4d8591d6d267 |
15 | 24da411b578b |
hex | 124f64c005bb |
20132202022331 has 32 divisors (see below), whose sum is σ = 24138964623360. Its totient is φ = 16425203929344.
The previous prime is 20132202022307. The next prime is 20132202022363. The reversal of 20132202022331 is 13322020223102.
It is not a de Polignac number, because 20132202022331 - 214 = 20132202005947 is a prime.
It is a super-2 number, since 2×201322020223312 (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 = 20132202022297 and 20132202022306.
It is not an unprimeable number, because it can be changed into a prime (20132202022531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31440146 + ... + 32074088.
It is an arithmetic number, because the mean of its divisors is an integer number (754342644480).
Almost surely, 220132202022331 is an apocalyptic number.
20132202022331 is a deficient number, since it is larger than the sum of its proper divisors (4006762601029).
20132202022331 is a wasteful number, since it uses less digits than its factorization.
20132202022331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 636195.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20132202022331 its reverse (13322020223102), we get a palindrome (33454222245433).
The spelling of 20132202022331 in words is "twenty trillion, one hundred thirty-two billion, two hundred two million, twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •