Base | Representation |
---|---|
bin | 100000000011110011110… |
… | …010010111011000011101 |
3 | 21210121121202101200101012 |
4 | 200003303302113120131 |
5 | 242043434002301023 |
6 | 4404032444225005 |
7 | 315112126153442 |
oct | 40036362273035 |
9 | 7717552350335 |
10 | 2203113322013 |
11 | 77a37604298a |
12 | 2b6b8a23b165 |
13 | 12c9a2894206 |
14 | 788ba2359c9 |
15 | 3c49492c978 |
hex | 200f3c9761d |
2203113322013 has 8 divisors (see below), whose sum is σ = 2280571416480. Its totient is φ = 2125754472240.
The previous prime is 2203113322001. The next prime is 2203113322021. The reversal of 2203113322013 is 3102233113022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2203113322013 - 230 = 2202039580189 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 2203113322013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2223113322013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24765995 + ... + 24854792.
It is an arithmetic number, because the mean of its divisors is an integer number (285071427060).
Almost surely, 22203113322013 is an apocalyptic number.
It is an amenable number.
2203113322013 is a deficient number, since it is larger than the sum of its proper divisors (77458094467).
2203113322013 is a wasteful number, since it uses less digits than its factorization.
2203113322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49622347.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2203113322013 its reverse (3102233113022), we get a palindrome (5305346435035).
The spelling of 2203113322013 in words is "two trillion, two hundred three billion, one hundred thirteen million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •