Base | Representation |
---|---|
bin | 1011000110111001101110… |
… | …1000111001011011110101 |
3 | 1121020120102010112110020111 |
4 | 2301232123220321123311 |
5 | 3100100120010241041 |
6 | 41550400150503021 |
7 | 2400242363300020 |
oct | 261563350713365 |
9 | 47216363473214 |
10 | 12213203212021 |
11 | 39896548a7679 |
12 | 1453001064a71 |
13 | 6a7914220a46 |
14 | 30319d4061b7 |
15 | 162a60587981 |
hex | b1b9ba396f5 |
12213203212021 has 8 divisors (see below), whose sum is σ = 13990181973824. Its totient is φ = 10444283311680.
The previous prime is 12213203212013. The next prime is 12213203212073. The reversal of 12213203212021 is 12021230231221.
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 12213203212021 - 23 = 12213203212013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12213203211983 and 12213203212001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12213203212081) 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, 2014712115 + ... + 2014718176.
It is an arithmetic number, because the mean of its divisors is an integer number (1748772746728).
Almost surely, 212213203212021 is an apocalyptic number.
It is an amenable number.
12213203212021 is a deficient number, since it is larger than the sum of its proper divisors (1776978761803).
12213203212021 is an equidigital number, since it uses as much as digits as its factorization.
12213203212021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4029430731.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12213203212021 its reverse (12021230231221), we get a palindrome (24234433443242).
The spelling of 12213203212021 in words is "twelve trillion, two hundred thirteen billion, two hundred three million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •