Base | Representation |
---|---|
bin | 1100000000100101111101… |
… | …1110111011001001010011 |
3 | 1201202022200120002122021121 |
4 | 3000021133132323021103 |
5 | 3212314432320110003 |
6 | 44025552555503111 |
7 | 2531660433052036 |
oct | 300113736731123 |
9 | 51668616078247 |
10 | 13204331410003 |
11 | 4230a1a932388 |
12 | 1593107a57a97 |
13 | 74a217473796 |
14 | 33914348901d |
15 | 17d71cee6cbd |
hex | c025f7bb253 |
13204331410003 has 16 divisors (see below), whose sum is σ = 14157785244960. Its totient is φ = 12270689353216.
The previous prime is 13204331410001. The next prime is 13204331410033. The reversal of 13204331410003 is 30001413340231.
It is a cyclic number.
It is not a de Polignac number, because 13204331410003 - 21 = 13204331410001 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 13204331410003.
It is not an unprimeable number, because it can be changed into a prime (13204331410001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 326500 + ... + 5149297.
It is an arithmetic number, because the mean of its divisors is an integer number (884861577810).
Almost surely, 213204331410003 is an apocalyptic number.
13204331410003 is a deficient number, since it is larger than the sum of its proper divisors (953453834957).
13204331410003 is a wasteful number, since it uses less digits than its factorization.
13204331410003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5477606.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13204331410003 its reverse (30001413340231), we get a palindrome (43205744750234).
The spelling of 13204331410003 in words is "thirteen trillion, two hundred four billion, three hundred thirty-one million, four hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •