Base | Representation |
---|---|
bin | 1100000111111010100010… |
… | …1001101001100101010011 |
3 | 1202012100100111100221222101 |
4 | 3001332220221221211103 |
5 | 3221400032412310003 |
6 | 44203434104021231 |
7 | 2544032425032106 |
oct | 301765051514523 |
9 | 52170314327871 |
10 | 13330113010003 |
11 | 427a2a6308119 |
12 | 15b356ba61817 |
13 | 7590413c952a |
14 | 3412765cc73d |
15 | 181b3084411d |
hex | c1fa8a69953 |
13330113010003 has 4 divisors (see below), whose sum is σ = 13379301619168. Its totient is φ = 13280924400840.
The previous prime is 13330113009979. The next prime is 13330113010061. The reversal of 13330113010003 is 30001031103331.
It is a happy number.
13330113010003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13330113010003 - 225 = 13330079455571 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13330113010103) 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, 24594304176 + ... + 24594304717.
It is an arithmetic number, because the mean of its divisors is an integer number (3344825404792).
Almost surely, 213330113010003 is an apocalyptic number.
13330113010003 is a deficient number, since it is larger than the sum of its proper divisors (49188609165).
13330113010003 is an equidigital number, since it uses as much as digits as its factorization.
13330113010003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49188609164.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 13330113010003 its reverse (30001031103331), we get a palindrome (43331144113334).
The spelling of 13330113010003 in words is "thirteen trillion, three hundred thirty billion, one hundred thirteen million, ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •