Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …0111011011011101101111 |
3 | 1120111101021210120021120122 |
4 | 2232221233213123131233 |
5 | 3033120104333411421 |
6 | 41305351533435155 |
7 | 2346055012134665 |
oct | 256515747333557 |
9 | 46441253507518 |
10 | 12002011232111 |
11 | 390802a4a32aa |
12 | 141a0a133babb |
13 | 690a2829a564 |
14 | 2d6c86b5cc35 |
15 | 15c2ee7a12ab |
hex | aea6f9db76f |
12002011232111 has 4 divisors (see below), whose sum is σ = 12294743213424. Its totient is φ = 11709279250800.
The previous prime is 12002011232047. The next prime is 12002011232161. The reversal of 12002011232111 is 11123211020021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12002011232111 - 26 = 12002011232047 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 12002011232111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002011232161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146365990595 + ... + 146365990676.
It is an arithmetic number, because the mean of its divisors is an integer number (3073685803356).
Almost surely, 212002011232111 is an apocalyptic number.
12002011232111 is a deficient number, since it is larger than the sum of its proper divisors (292731981313).
12002011232111 is an equidigital number, since it uses as much as digits as its factorization.
12002011232111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292731981312.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12002011232111 its reverse (11123211020021), we get a palindrome (23125222252132).
The spelling of 12002011232111 in words is "twelve trillion, two billion, eleven million, two hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •