Base | Representation |
---|---|
bin | 10100100111001000… |
… | …010101000100000011 |
3 | 2010010101000010012012 |
4 | 110213020111010003 |
5 | 330311110100311 |
6 | 14100023123135 |
7 | 1412302132604 |
oct | 244710250403 |
9 | 63111003165 |
10 | 22131331331 |
11 | 942761787a |
12 | 43578a34ab |
13 | 2119115735 |
14 | 10dd3a9dab |
15 | 897e2178b |
hex | 527215103 |
22131331331 has 16 divisors (see below), whose sum is σ = 23223390528. Its totient is φ = 21050409600.
The previous prime is 22131331319. The next prime is 22131331361. The reversal of 22131331331 is 13313313122.
It is not a de Polignac number, because 22131331331 - 210 = 22131330307 is a prime.
It is a super-2 number, since 2×221313313312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22131331297 and 22131331306.
It is not an unprimeable number, because it can be changed into a prime (22131331361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3443501 + ... + 3449921.
It is an arithmetic number, because the mean of its divisors is an integer number (1451461908).
Almost surely, 222131331331 is an apocalyptic number.
22131331331 is a deficient number, since it is larger than the sum of its proper divisors (1092059197).
22131331331 is a wasteful number, since it uses less digits than its factorization.
22131331331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7262.
The product of its digits is 972, while the sum is 23.
Adding to 22131331331 its reverse (13313313122), we get a palindrome (35444644453).
The spelling of 22131331331 in words is "twenty-two billion, one hundred thirty-one million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •