Base | Representation |
---|---|
bin | 1100000110001111010100… |
… | …0011001011110100110011 |
3 | 1202002121001120001121200102 |
4 | 3001203311003023310303 |
5 | 3220412110440014303 |
6 | 44142314024143015 |
7 | 2541663233346416 |
oct | 301436503136463 |
9 | 52077046047612 |
10 | 13301330001203 |
11 | 4269076025642 |
12 | 15a9a78607a6b |
13 | 7564051c768a |
14 | 33db05a57b7d |
15 | 180ee89b0288 |
hex | c18f50cbd33 |
13301330001203 has 8 divisors (see below), whose sum is σ = 13318464850320. Its totient is φ = 13284195746400.
The previous prime is 13301330001191. The next prime is 13301330001227. The reversal of 13301330001203 is 30210003310331.
13301330001203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13301330001203 - 240 = 12201818373427 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13301330001263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60543653 + ... + 60762953.
It is an arithmetic number, because the mean of its divisors is an integer number (1664808106290).
Almost surely, 213301330001203 is an apocalyptic number.
13301330001203 is a deficient number, since it is larger than the sum of its proper divisors (17134849117).
13301330001203 is an equidigital number, since it uses as much as digits as its factorization.
13301330001203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297157.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 13301330001203 its reverse (30210003310331), we get a palindrome (43511333311534).
The spelling of 13301330001203 in words is "thirteen trillion, three hundred one billion, three hundred thirty million, one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •