Base | Representation |
---|---|
bin | 100000000100000000000… |
… | …111010001101010101111 |
3 | 21210122011011112121220112 |
4 | 200010000013101222233 |
5 | 242044344423131343 |
6 | 4404105153010235 |
7 | 315120220045022 |
oct | 40040007215257 |
9 | 7718134477815 |
10 | 2203320130223 |
11 | 77a471855a63 |
12 | 2b702755397b |
13 | 12ca06693334 |
14 | 788d98ab1b9 |
15 | 3c4a7b7e218 |
hex | 201001d1aaf |
2203320130223 has 16 divisors (see below), whose sum is σ = 2303333250816. Its totient is φ = 2103660599040.
The previous prime is 2203320130213. The next prime is 2203320130273. The reversal of 2203320130223 is 3220310233022.
It is a cyclic number.
It is not a de Polignac number, because 2203320130223 - 230 = 2202246388399 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2203320130213) 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, 47450888 + ... + 47497298.
It is an arithmetic number, because the mean of its divisors is an integer number (143958328176).
Almost surely, 22203320130223 is an apocalyptic number.
2203320130223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2203320130223 is a deficient number, since it is larger than the sum of its proper divisors (100013120593).
2203320130223 is a wasteful number, since it uses less digits than its factorization.
2203320130223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50174.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 2203320130223 its reverse (3220310233022), we get a palindrome (5423630363245).
The spelling of 2203320130223 in words is "two trillion, two hundred three billion, three hundred twenty million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •