Base | Representation |
---|---|
bin | 10110100100110100… |
… | …01101100001101110 |
3 | 1011021122221212100110 |
4 | 23102122031201232 |
5 | 144310211133402 |
6 | 5322354040450 |
7 | 606226323330 |
oct | 132232154156 |
9 | 34248855313 |
10 | 12120021102 |
11 | 515a488272 |
12 | 2422b79126 |
13 | 11b1c98227 |
14 | 82d941450 |
15 | 4ae07c56c |
hex | 2d268d86e |
12120021102 has 16 divisors (see below), whose sum is σ = 27702905472. Its totient is φ = 3462863160.
The previous prime is 12120021101. The next prime is 12120021103. The reversal of 12120021102 is 20112002121.
12120021102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12120021101) and next prime (12120021103).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120021101) 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 7 ways as a sum of consecutive naturals, for example, 144285924 + ... + 144286007.
It is an arithmetic number, because the mean of its divisors is an integer number (1731431592).
Almost surely, 212120021102 is an apocalyptic number.
12120021102 is an abundant number, since it is smaller than the sum of its proper divisors (15582884370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12120021102 is a wasteful number, since it uses less digits than its factorization.
12120021102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288571943.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12120021102 its reverse (20112002121), we get a palindrome (32232023223).
The spelling of 12120021102 in words is "twelve billion, one hundred twenty million, twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •