Base | Representation |
---|---|
bin | 1011000110001101000101… |
… | …1101001001110100110011 |
3 | 1121012102111002021020102001 |
4 | 2301203101131021310303 |
5 | 3044401100111414303 |
6 | 41541055202434431 |
7 | 2366336431005616 |
oct | 261432135116463 |
9 | 47172432236361 |
10 | 12201221201203 |
11 | 39845663125a1 |
12 | 1450818362a17 |
13 | 6a6754a17308 |
14 | 302783d4c17d |
15 | 1625ad6bc31d |
hex | b18d1749d33 |
12201221201203 has 8 divisors (see below), whose sum is σ = 12206779215120. Its totient is φ = 12195664368480.
The previous prime is 12201221201201. The next prime is 12201221201231. The reversal of 12201221201203 is 30210212210221.
12201221201203 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 12201221201203 - 21 = 12201221201201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12201221201201) 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, 20707353 + ... + 21288421.
It is an arithmetic number, because the mean of its divisors is an integer number (1525847401890).
Almost surely, 212201221201203 is an apocalyptic number.
12201221201203 is a deficient number, since it is larger than the sum of its proper divisors (5558013917).
12201221201203 is an equidigital number, since it uses as much as digits as its factorization.
12201221201203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590597.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12201221201203 its reverse (30210212210221), we get a palindrome (42411433411424).
The spelling of 12201221201203 in words is "twelve trillion, two hundred one billion, two hundred twenty-one million, two hundred one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •