Base | Representation |
---|---|
bin | 1010000100001000011111… |
… | …10001100100111110001101 |
3 | 2220100211011020111210121220 |
4 | 11002010033301210332031 |
5 | 10400103302132143041 |
6 | 115023223455113553 |
7 | 4443000214422324 |
oct | 502041761447615 |
9 | 86324136453556 |
10 | 22132231131021 |
11 | 706325453a790 |
12 | 259545b5128b9 |
13 | c470a2a30cab |
14 | 5672c46390bb |
15 | 285a9b9e2d66 |
hex | 14210fc64f8d |
22132231131021 has 8 divisors (see below), whose sum is σ = 32192336190624. Its totient is φ = 13413473412720.
The previous prime is 22132231131001. The next prime is 22132231131107. The reversal of 22132231131021 is 12013113223122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22132231131021 - 26 = 22132231130957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22132231130982 and 22132231131000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22132231131001) 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, 335336835286 + ... + 335336835351.
It is an arithmetic number, because the mean of its divisors is an integer number (4024042023828).
Almost surely, 222132231131021 is an apocalyptic number.
It is an amenable number.
22132231131021 is a deficient number, since it is larger than the sum of its proper divisors (10060105059603).
22132231131021 is a wasteful number, since it uses less digits than its factorization.
22132231131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670673670651.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 22132231131021 its reverse (12013113223122), we get a palindrome (34145344354143).
The spelling of 22132231131021 in words is "twenty-two trillion, one hundred thirty-two billion, two hundred thirty-one million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •