Base | Representation |
---|---|
bin | 1110100110100011101001… |
… | …00111110111010010010110 |
3 | 11012200210110000012211120011 |
4 | 13103101310213313102112 |
5 | 13202102044310041042 |
6 | 152143352255030434 |
7 | 6522644534303665 |
oct | 723216447672226 |
9 | 135623400184504 |
10 | 32111132112022 |
11 | a260288a3a517 |
12 | 372742920b41a |
13 | 14bc0b38b5592 |
14 | 7d028951addc |
15 | 3aa43e479a17 |
hex | 1d34749f7496 |
32111132112022 has 4 divisors (see below), whose sum is σ = 48166698168036. Its totient is φ = 16055566056010.
The previous prime is 32111132112001. The next prime is 32111132112023. The reversal of 32111132112022 is 22021123111123.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×321111321120222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32111132111984 and 32111132112002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32111132112023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8027783028004 + ... + 8027783028007.
It is an arithmetic number, because the mean of its divisors is an integer number (12041674542009).
Almost surely, 232111132112022 is an apocalyptic number.
32111132112022 is a deficient number, since it is larger than the sum of its proper divisors (16055566056014).
32111132112022 is a wasteful number, since it uses less digits than its factorization.
32111132112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16055566056013.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 32111132112022 its reverse (22021123111123), we get a palindrome (54132255223145).
The spelling of 32111132112022 in words is "thirty-two trillion, one hundred eleven billion, one hundred thirty-two million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •