Base | Representation |
---|---|
bin | 10110011001001011… |
… | …00011101011000101 |
3 | 1011000212010202020022 |
4 | 23030211203223011 |
5 | 144110204111401 |
6 | 5304544144525 |
7 | 603632064623 |
oct | 131445435305 |
9 | 34025122208 |
10 | 12022332101 |
11 | 510a32505a |
12 | 23b6308145 |
13 | 11979835a0 |
14 | 820992513 |
15 | 4a56d271b |
hex | 2cc963ac5 |
12022332101 has 16 divisors (see below), whose sum is σ = 13118703360. Its totient is φ = 10950638400.
The previous prime is 12022332097. The next prime is 12022332163. The reversal of 12022332101 is 10123322021.
12022332101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12022332101 - 22 = 12022332097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12022332101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12022332181) 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 15 ways as a sum of consecutive naturals, for example, 3246551 + ... + 3250251.
It is an arithmetic number, because the mean of its divisors is an integer number (819918960).
Almost surely, 212022332101 is an apocalyptic number.
It is an amenable number.
12022332101 is a deficient number, since it is larger than the sum of its proper divisors (1096371259).
12022332101 is a wasteful number, since it uses less digits than its factorization.
12022332101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6956.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12022332101 its reverse (10123322021), we get a palindrome (22145654122).
The spelling of 12022332101 in words is "twelve billion, twenty-two million, three hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •