Base | Representation |
---|---|
bin | 1100000000011110000111… |
… | …0100011100011100101111 |
3 | 1201202010020121222112011000 |
4 | 3000013201310130130233 |
5 | 3212301123104402343 |
6 | 44025003443531343 |
7 | 2531554252646322 |
oct | 300074164343457 |
9 | 51663217875130 |
10 | 13202223122223 |
11 | 4230038853593 |
12 | 1592819989b53 |
13 | 749c6c743515 |
14 | 338dc34827b9 |
15 | 17d647d93ed3 |
hex | c01e1d1c72f |
13202223122223 has 64 divisors (see below), whose sum is σ = 20646696960000. Its totient is φ = 8326414608480.
The previous prime is 13202223122173. The next prime is 13202223122237. The reversal of 13202223122223 is 32222132220231.
13202223122223 is a `hidden beast` number, since 1 + 3 + 202 + 2 + 231 + 2 + 2 + 223 = 666.
It is not a de Polignac number, because 13202223122223 - 212 = 13202223118127 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202223122243) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8092788 + ... + 9586326.
It is an arithmetic number, because the mean of its divisors is an integer number (322604640000).
Almost surely, 213202223122223 is an apocalyptic number.
13202223122223 is a deficient number, since it is larger than the sum of its proper divisors (7444473837777).
13202223122223 is a wasteful number, since it uses less digits than its factorization.
13202223122223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493817 (or 1493811 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 13202223122223 its reverse (32222132220231), we get a palindrome (45424355342454).
The spelling of 13202223122223 in words is "thirteen trillion, two hundred two billion, two hundred twenty-three million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •