Base | Representation |
---|---|
bin | 1011000110001111111111… |
… | …1000000010100010110001 |
3 | 1121012111111100201101011102 |
4 | 2301203333320002202301 |
5 | 3044404144000014301 |
6 | 41541304343054145 |
7 | 2366364635464553 |
oct | 261437770024261 |
9 | 47174440641142 |
10 | 12202000001201 |
11 | 398492599355a |
12 | 14509b5141355 |
13 | 6a684a18680a |
14 | 3028195594d3 |
15 | 162606c57b6b |
hex | b18ffe028b1 |
12202000001201 has 64 divisors (see below), whose sum is σ = 14221294675200. Its totient is φ = 10396966035456.
The previous prime is 12202000001173. The next prime is 12202000001203. The reversal of 12202000001201 is 10210000020221.
It is a happy number.
12202000001201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12202000001201 - 26 = 12202000001137 is a prime.
It is a super-3 number, since 3×122020000012013 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (12202000001203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 102020831 + ... + 102140363.
It is an arithmetic number, because the mean of its divisors is an integer number (222207729300).
Almost surely, 212202000001201 is an apocalyptic number.
It is an amenable number.
12202000001201 is a deficient number, since it is larger than the sum of its proper divisors (2019294673999).
12202000001201 is a wasteful number, since it uses less digits than its factorization.
12202000001201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119778.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12202000001201 its reverse (10210000020221), we get a palindrome (22412000021422).
The spelling of 12202000001201 in words is "twelve trillion, two hundred two billion, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •