Base | Representation |
---|---|
bin | 1100000000011101110001… |
… | …1001111111010011011111 |
3 | 1201202010000022002022212212 |
4 | 3000013130121333103133 |
5 | 3212300431332113043 |
6 | 44024550441151035 |
7 | 2531552100663431 |
oct | 300073431772337 |
9 | 51663008068785 |
10 | 13202132301023 |
11 | 422aaa1561246 |
12 | 15927b348b47b |
13 | 749c56994873 |
14 | 338db53a0651 |
15 | 17d63ee04018 |
hex | c01dc67f4df |
13202132301023 has 4 divisors (see below), whose sum is σ = 13205055071160. Its totient is φ = 13199209530888.
The previous prime is 13202132300999. The next prime is 13202132301049. The reversal of 13202132301023 is 32010323120231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13202132301023 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 13202132301023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202132301073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1461378293 + ... + 1461387326.
It is an arithmetic number, because the mean of its divisors is an integer number (3301263767790).
Almost surely, 213202132301023 is an apocalyptic number.
13202132301023 is a deficient number, since it is larger than the sum of its proper divisors (2922770137).
13202132301023 is an equidigital number, since it uses as much as digits as its factorization.
13202132301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2922770136.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13202132301023 its reverse (32010323120231), we get a palindrome (45212455421254).
The spelling of 13202132301023 in words is "thirteen trillion, two hundred two billion, one hundred thirty-two million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •