Base | Representation |
---|---|
bin | 101101111011101010010101… |
… | …100000000100011011100101 |
3 | 222111021011021121121200100120 |
4 | 231323222111200010123211 |
5 | 202434231034000341010 |
6 | 1553351010500232153 |
7 | 60356612452246401 |
oct | 5573522540043345 |
9 | 874234247550316 |
10 | 202012000012005 |
11 | 59404898623827 |
12 | 1a7a734209b659 |
13 | 889485a990371 |
14 | 37c560c0d6101 |
15 | 1854be07e0e70 |
hex | b7ba958046e5 |
202012000012005 has 16 divisors (see below), whose sum is σ = 324009467021760. Its totient is φ = 107476311005568.
The previous prime is 202012000012003. The next prime is 202012000012027. The reversal of 202012000012005 is 500210000210202.
202012000012005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202012000012005 - 21 = 202012000012003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202012000012003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16463889547 + ... + 16463901816.
It is an arithmetic number, because the mean of its divisors is an integer number (20250591688860).
Almost surely, 2202012000012005 is an apocalyptic number.
It is an amenable number.
202012000012005 is a deficient number, since it is larger than the sum of its proper divisors (121997467009755).
202012000012005 is a wasteful number, since it uses less digits than its factorization.
202012000012005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32927791780.
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 202012000012005 its reverse (500210000210202), we get a palindrome (702222000222207).
The spelling of 202012000012005 in words is "two hundred two trillion, twelve billion, twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •