Base | Representation |
---|---|
bin | 1011000111011011101111… |
… | …0000100010100100010011 |
3 | 1121021102222022222222222011 |
4 | 2301312323300202210103 |
5 | 3100222313444133021 |
6 | 41554510052523351 |
7 | 2401014532011340 |
oct | 261667360424423 |
9 | 47242868888864 |
10 | 12222332021011 |
11 | 3992509876a12 |
12 | 145492a320557 |
13 | 6a873a590678 |
14 | 3037c798b7c7 |
15 | 162de6c09de1 |
hex | b1dbbc22913 |
12222332021011 has 8 divisors (see below), whose sum is σ = 13975183355744. Its totient is φ = 10471181662080.
The previous prime is 12222332020999. The next prime is 12222332021021. The reversal of 12222332021011 is 11012023322221.
12222332021011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12222332021011 - 213 = 12222332012819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12222332021021) 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, 425228550 + ... + 425257291.
It is an arithmetic number, because the mean of its divisors is an integer number (1746897919468).
Almost surely, 212222332021011 is an apocalyptic number.
12222332021011 is a deficient number, since it is larger than the sum of its proper divisors (1752851334733).
12222332021011 is an equidigital number, since it uses as much as digits as its factorization.
12222332021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850487901.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12222332021011 its reverse (11012023322221), we get a palindrome (23234355343232).
The spelling of 12222332021011 in words is "twelve trillion, two hundred twenty-two billion, three hundred thirty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •