Base | Representation |
---|---|
bin | 1100000000011101010100… |
… | …1011110000100010100111 |
3 | 1201202002200212002012112001 |
4 | 3000013111023300202213 |
5 | 3212300204322130043 |
6 | 44024530432110131 |
7 | 2531546100024262 |
oct | 300072513604247 |
9 | 51662625065461 |
10 | 13202011130023 |
11 | 422aa3a11a721 |
12 | 159277a995347 |
13 | 749c3784a951 |
14 | 338da325bcd9 |
15 | 17d63446b74d |
hex | c01d52f08a7 |
13202011130023 has 8 divisors (see below), whose sum is σ = 13494070298880. Its totient is φ = 12913075588920.
The previous prime is 13202011129939. The next prime is 13202011130047. The reversal of 13202011130023 is 32003111020231.
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 13202011130023 - 217 = 13202010998951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202011130093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 780898393 + ... + 780915298.
It is an arithmetic number, because the mean of its divisors is an integer number (1686758787360).
Almost surely, 213202011130023 is an apocalyptic number.
13202011130023 is a deficient number, since it is larger than the sum of its proper divisors (292059168857).
13202011130023 is a wasteful number, since it uses less digits than its factorization.
13202011130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561813877.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13202011130023 its reverse (32003111020231), we get a palindrome (45205122150254).
The spelling of 13202011130023 in words is "thirteen trillion, two hundred two billion, eleven million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •