Base | Representation |
---|---|
bin | 100001100001111110001… |
… | …110100100101011000111 |
3 | 22011021121001212021100110 |
4 | 201201332032210223013 |
5 | 300223020334020403 |
6 | 4522313312044103 |
7 | 325321503465204 |
oct | 41417616445307 |
9 | 8137531767313 |
10 | 2304220220103 |
11 | 80923a27499a |
12 | 3126a6833633 |
13 | 1393967cb329 |
14 | 7d74c2accab |
15 | 3ee10e12103 |
hex | 2187e3a4ac7 |
2304220220103 has 16 divisors (see below), whose sum is σ = 3093015564800. Its totient is φ = 1525810604544.
The previous prime is 2304220220101. The next prime is 2304220220129. The reversal of 2304220220103 is 3010220224032.
2304220220103 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 2304220220103 - 21 = 2304220220101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2304220220103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2304220220101) 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, 2722303 + ... + 3466896.
It is an arithmetic number, because the mean of its divisors is an integer number (193313472800).
Almost surely, 22304220220103 is an apocalyptic number.
2304220220103 is a deficient number, since it is larger than the sum of its proper divisors (788795344697).
2304220220103 is a wasteful number, since it uses less digits than its factorization.
2304220220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6190038.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 2304220220103 its reverse (3010220224032), we get a palindrome (5314440444135).
The spelling of 2304220220103 in words is "two trillion, three hundred four billion, two hundred twenty million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •