Base | Representation |
---|---|
bin | 1100000110110000000010… |
… | …0100111001100011000011 |
3 | 1202010102201200102121100122 |
4 | 3001230000210321203003 |
5 | 3221033103002320303 |
6 | 44150325345210455 |
7 | 2542424005351244 |
oct | 301540044714303 |
9 | 52112650377318 |
10 | 13310113323203 |
11 | 4271872a82444 |
12 | 15ab70a030a2b |
13 | 7571a4b01328 |
14 | 3402da388ccb |
15 | 18135eb3ae38 |
hex | c1b009398c3 |
13310113323203 has 8 divisors (see below), whose sum is σ = 13873873672272. Its totient is φ = 12757091266656.
The previous prime is 13310113323181. The next prime is 13310113323217. The reversal of 13310113323203 is 30232331101331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13310113323203 - 26 = 13310113323139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13310113329203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2684570600 + ... + 2684575557.
It is an arithmetic number, because the mean of its divisors is an integer number (1734234209034).
Almost surely, 213310113323203 is an apocalyptic number.
13310113323203 is a deficient number, since it is larger than the sum of its proper divisors (563760349069).
13310113323203 is an equidigital number, since it uses as much as digits as its factorization.
13310113323203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5369146261.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13310113323203 its reverse (30232331101331), we get a palindrome (43542444424534).
The spelling of 13310113323203 in words is "thirteen trillion, three hundred ten billion, one hundred thirteen million, three hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •