Base | Representation |
---|---|
bin | 1011000000011100010010… |
… | …0101110010001011001100 |
3 | 1120211221221121010121221000 |
4 | 2300013010211302023030 |
5 | 3041240322101041022 |
6 | 41423403355140300 |
7 | 2356233215100153 |
oct | 260070445621314 |
9 | 46757847117830 |
10 | 12102221112012 |
11 | 394658334a269 |
12 | 14355a9444690 |
13 | 69a308413295 |
14 | 2dba71a1459a |
15 | 15ec171476ac |
hex | b01c49722cc |
12102221112012 has 48 divisors (see below), whose sum is σ = 31376420419680. Its totient is φ = 4034036211264.
The previous prime is 12102221112001. The next prime is 12102221112013. The reversal of 12102221112012 is 21021112220121.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (12102221112013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12700318 + ... + 13619930.
It is an arithmetic number, because the mean of its divisors is an integer number (653675425410).
Almost surely, 212102221112012 is an apocalyptic number.
12102221112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12102221112012 is an abundant number, since it is smaller than the sum of its proper divisors (19274199307668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102221112012 is a wasteful number, since it uses less digits than its factorization.
12102221112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1041479 (or 1041471 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12102221112012 its reverse (21021112220121), we get a palindrome (33123333332133).
The spelling of 12102221112012 in words is "twelve trillion, one hundred two billion, two hundred twenty-one million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •