Base | Representation |
---|---|
bin | 1011000000011011110101… |
… | …1000100101100110010000 |
3 | 1120211221122011122021102221 |
4 | 2300012331120211212100 |
5 | 3041240100123241422 |
6 | 41423343355550424 |
7 | 2356230216340261 |
oct | 260067530454620 |
9 | 46757564567387 |
10 | 12102100212112 |
11 | 3946521083399 |
12 | 1435574a5b414 |
13 | 69a2b9362891 |
14 | 2dba5d942968 |
15 | 15ec0b7153c7 |
hex | b01bd625990 |
12102100212112 has 10 divisors (see below), whose sum is σ = 23447819160998. Its totient is φ = 6051050106048.
The previous prime is 12102100212089. The next prime is 12102100212133. The reversal of 12102100212112 is 21121200120121.
It can be written as a sum of positive squares in only one way, i.e., 9731929116816 + 2370171095296 = 3119604^2 + 1539536^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 756381263257 = 12102100212112 / (1 + 2 + 1 + 0 + 2 + 1 + 0 + 0 + 2 + 1 + 2 + 1 + 1 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 378190631613 + ... + 378190631644.
Almost surely, 212102100212112 is an apocalyptic number.
It is an amenable number.
12102100212112 is a deficient number, since it is larger than the sum of its proper divisors (11345718948886).
12102100212112 is an equidigital number, since it uses as much as digits as its factorization.
12102100212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756381263265 (or 756381263259 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12102100212112 its reverse (21121200120121), we get a palindrome (33223300332233).
The spelling of 12102100212112 in words is "twelve trillion, one hundred two billion, one hundred million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •