Base | Representation |
---|---|
bin | 1100000111011001011010… |
… | …0101111011100001000011 |
3 | 1202011111101201210212002112 |
4 | 3001312112211323201003 |
5 | 3221223324322013103 |
6 | 44155403430205535 |
7 | 2543266152445112 |
oct | 301662645734103 |
9 | 52144351725075 |
10 | 13321220110403 |
11 | 4276552518017 |
12 | 15b18a97b38ab |
13 | 758254ba786a |
14 | 340a714d5c79 |
15 | 1817aec70cd8 |
hex | c1d9697b843 |
13321220110403 has 16 divisors (see below), whose sum is σ = 14234586263040. Its totient is φ = 12436157409984.
The previous prime is 13321220110397. The next prime is 13321220110453. The reversal of 13321220110403 is 30401102212331.
13321220110403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13321220110403 - 28 = 13321220110147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13321220110453) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3879938 + ... + 6457271.
It is an arithmetic number, because the mean of its divisors is an integer number (889661641440).
Almost surely, 213321220110403 is an apocalyptic number.
13321220110403 is a deficient number, since it is larger than the sum of its proper divisors (913366152637).
13321220110403 is a wasteful number, since it uses less digits than its factorization.
13321220110403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10338578.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13321220110403 its reverse (30401102212331), we get a palindrome (43722322322734).
The spelling of 13321220110403 in words is "thirteen trillion, three hundred twenty-one billion, two hundred twenty million, one hundred ten thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •