Base | Representation |
---|---|
bin | 100000000100000101001… |
… | …011000010110101010011 |
3 | 21210122101002020200000000 |
4 | 200010011023002311103 |
5 | 242100033140112430 |
6 | 4404121424101043 |
7 | 315122300340540 |
oct | 40040513026523 |
9 | 7718332220000 |
10 | 2203405004115 |
11 | 77a505755a77 |
12 | 2b704ba64783 |
13 | 12ca1b13bc83 |
14 | 78906c81bc7 |
15 | 3c4b0346e60 |
hex | 201052c2d53 |
2203405004115 has 144 divisors (see below), whose sum is σ = 4538717696448. Its totient is φ = 1005886750464.
The previous prime is 2203405003997. The next prime is 2203405004117. The reversal of 2203405004115 is 5114005043022.
2203405004115 is a `hidden beast` number, since 2 + 2 + 0 + 3 + 40 + 500 + 4 + 115 = 666.
It is not a de Polignac number, because 2203405004115 - 221 = 2203402906963 is a prime.
It is a super-2 number, since 2×22034050041152 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2203405004117) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 177501649 + ... + 177514061.
It is an arithmetic number, because the mean of its divisors is an integer number (31518872892).
Almost surely, 22203405004115 is an apocalyptic number.
2203405004115 is an abundant number, since it is smaller than the sum of its proper divisors (2335312692333).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2203405004115 is an frugal number, since it uses more digits than its factorization.
2203405004115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13222 (or 13201 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 2203405004115 in words is "two trillion, two hundred three billion, four hundred five million, four thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •