Base | Representation |
---|---|
bin | 1010111011101010011001… |
… | …1101010101011100111111 |
3 | 1120120010000012212000122220 |
4 | 2232322212131111130333 |
5 | 3033414141431431421 |
6 | 41321543550540423 |
7 | 2350265363265555 |
oct | 256724635253477 |
9 | 46503005760586 |
10 | 12020111202111 |
11 | 39147784566a1 |
12 | 14216b2b07713 |
13 | 692651130a8c |
14 | 2d7ac296dbd5 |
15 | 15ca0d8053c6 |
hex | aeea675573f |
12020111202111 has 8 divisors (see below), whose sum is σ = 16027105881984. Its totient is φ = 8013261995160.
The previous prime is 12020111202097. The next prime is 12020111202193. The reversal of 12020111202111 is 11120211102021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12020111202111 - 217 = 12020111071039 is a prime.
It is a super-3 number, since 3×120201112021113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020111202511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36175285 + ... + 36506046.
It is an arithmetic number, because the mean of its divisors is an integer number (2003388235248).
Almost surely, 212020111202111 is an apocalyptic number.
12020111202111 is a deficient number, since it is larger than the sum of its proper divisors (4006994679873).
12020111202111 is an equidigital number, since it uses as much as digits as its factorization.
12020111202111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72736461.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12020111202111 its reverse (11120211102021), we get a palindrome (23140322304132).
The spelling of 12020111202111 in words is "twelve trillion, twenty billion, one hundred eleven million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •