Base | Representation |
---|---|
bin | 1100000000011110000100… |
… | …1101111000011011100111 |
3 | 1201202010012220221221012121 |
4 | 3000013201031320123213 |
5 | 3212301113012410343 |
6 | 44025002443130411 |
7 | 2531554101014113 |
oct | 300074115703347 |
9 | 51663186857177 |
10 | 13202213013223 |
11 | 4230033079543 |
12 | 1592816513a07 |
13 | 749c6a614170 |
14 | 338dc1db0743 |
15 | 17d647048aed |
hex | c01e13786e7 |
13202213013223 has 4 divisors (see below), whose sum is σ = 14217767860408. Its totient is φ = 12186658166040.
The previous prime is 13202213013221. The next prime is 13202213013263. The reversal of 13202213013223 is 32231031220231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13202213013223 - 21 = 13202213013221 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 (13202213013221) 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, 507777423573 + ... + 507777423598.
It is an arithmetic number, because the mean of its divisors is an integer number (3554441965102).
Almost surely, 213202213013223 is an apocalyptic number.
13202213013223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13202213013223 is a deficient number, since it is larger than the sum of its proper divisors (1015554847185).
13202213013223 is a wasteful number, since it uses less digits than its factorization.
13202213013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015554847184.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13202213013223 its reverse (32231031220231), we get a palindrome (45433244233454).
The spelling of 13202213013223 in words is "thirteen trillion, two hundred two billion, two hundred thirteen million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •