Base | Representation |
---|---|
bin | 100000000010000001110… |
… | …100001100101111101001 |
3 | 21210102200111101211020021 |
4 | 200002001310030233221 |
5 | 242031030001400410 |
6 | 4403115021000441 |
7 | 315013550326135 |
oct | 40020164145751 |
9 | 7712614354207 |
10 | 2201201200105 |
11 | 779584768446 |
12 | 2b67359b3121 |
13 | 12c7596a802b |
14 | 787782d43c5 |
15 | 3c3d1b27eda |
hex | 20081d0cbe9 |
2201201200105 has 4 divisors (see below), whose sum is σ = 2641441440132. Its totient is φ = 1760960960080.
The previous prime is 2201201200063. The next prime is 2201201200139. The reversal of 2201201200105 is 5010021021022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1183128272089 + 1018072928016 = 1087717^2 + 1008996^2 .
It is a de Polignac number, because none of the positive numbers 2k-2201201200105 is a prime.
It is a super-2 number, since 2×22012012001052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220120120006 + ... + 220120120015.
It is an arithmetic number, because the mean of its divisors is an integer number (660360360033).
Almost surely, 22201201200105 is an apocalyptic number.
It is an amenable number.
2201201200105 is a deficient number, since it is larger than the sum of its proper divisors (440240240027).
2201201200105 is an equidigital number, since it uses as much as digits as its factorization.
2201201200105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440240240026.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 2201201200105 its reverse (5010021021022), we get a palindrome (7211222221127).
The spelling of 2201201200105 in words is "two trillion, two hundred one billion, two hundred one million, two hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •