Base | Representation |
---|---|
bin | 1010000001001100010111… |
… | …10001010010000101010100 |
3 | 2220000011110110020011220202 |
4 | 11000212023301102011110 |
5 | 10341424430421311312 |
6 | 114505001445520032 |
7 | 4432463320661336 |
oct | 500461361220524 |
9 | 86004413204822 |
10 | 22031232213332 |
11 | 702443625aa81 |
12 | 2579973113018 |
13 | c3a6c82a2bc4 |
14 | 562462a6d456 |
15 | 283139c3c9c2 |
hex | 14098bc52154 |
22031232213332 has 12 divisors (see below), whose sum is σ = 38737379864736. Its totient is φ = 10963409394840.
The previous prime is 22031232213329. The next prime is 22031232213337. The reversal of 22031232213332 is 23331223213022.
It is a junction number, because it is equal to n+sod(n) for n = 22031232213295 and 22031232213304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22031232213337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13051677008 + ... + 13051678695.
It is an arithmetic number, because the mean of its divisors is an integer number (3228114988728).
Almost surely, 222031232213332 is an apocalyptic number.
It is an amenable number.
22031232213332 is a deficient number, since it is larger than the sum of its proper divisors (16706147651404).
22031232213332 is a wasteful number, since it uses less digits than its factorization.
22031232213332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26103355918 (or 26103355916 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 22031232213332 its reverse (23331223213022), we get a palindrome (45362455426354).
The spelling of 22031232213332 in words is "twenty-two trillion, thirty-one billion, two hundred thirty-two million, two hundred thirteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •