Base | Representation |
---|---|
bin | 1100000001000011010010… |
… | …1010101111011101111001 |
3 | 1201210002000010220222020010 |
4 | 3000100310222233131321 |
5 | 3212432042433202301 |
6 | 44033334031452133 |
7 | 2532356464464531 |
oct | 300206452573571 |
9 | 51702003828203 |
10 | 13212203022201 |
11 | 423429a18a107 |
12 | 1594744087049 |
13 | 74aba0213b91 |
14 | 33968ca924c1 |
15 | 17da2e0d15d6 |
hex | c0434aaf779 |
13212203022201 has 8 divisors (see below), whose sum is σ = 17754981489664. Its totient is φ = 8738779951440.
The previous prime is 13212203022191. The next prime is 13212203022229. The reversal of 13212203022201 is 10222030221231.
13212203022201 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 not a de Polignac number, because 13212203022201 - 211 = 13212203020153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13212203022001) 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, 17338848730 + ... + 17338849491.
It is an arithmetic number, because the mean of its divisors is an integer number (2219372686208).
Almost surely, 213212203022201 is an apocalyptic number.
It is an amenable number.
13212203022201 is a deficient number, since it is larger than the sum of its proper divisors (4542778467463).
13212203022201 is a wasteful number, since it uses less digits than its factorization.
13212203022201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34677698351.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13212203022201 its reverse (10222030221231), we get a palindrome (23434233243432).
The spelling of 13212203022201 in words is "thirteen trillion, two hundred twelve billion, two hundred three million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •