Base | Representation |
---|---|
bin | 1100000110001110100111… |
… | …0010100110001001100001 |
3 | 1202002120120101121121100010 |
4 | 3001203221302212021201 |
5 | 3220411214110300301 |
6 | 44142243155315133 |
7 | 2541655450631400 |
oct | 301435162461141 |
9 | 52076511547303 |
10 | 13301141103201 |
11 | 4268a89435796 |
12 | 15a9a252abaa9 |
13 | 7563a5029703 |
14 | 33dac8925637 |
15 | 180ed70ea5d6 |
hex | c18e9ca6261 |
13301141103201 has 24 divisors (see below), whose sum is σ = 20744321130624. Its totient is φ = 7558659491040.
The previous prime is 13301141103149. The next prime is 13301141103203. The reversal of 13301141103201 is 10230114110331.
It is not a de Polignac number, because 13301141103201 - 26 = 13301141103137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (13301141103203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 249929065 + ... + 249982278.
It is an arithmetic number, because the mean of its divisors is an integer number (864346713776).
Almost surely, 213301141103201 is an apocalyptic number.
It is an amenable number.
13301141103201 is a deficient number, since it is larger than the sum of its proper divisors (7443180027423).
13301141103201 is a wasteful number, since it uses less digits than its factorization.
13301141103201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499911541 (or 499911534 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13301141103201 its reverse (10230114110331), we get a palindrome (23531255213532).
The spelling of 13301141103201 in words is "thirteen trillion, three hundred one billion, one hundred forty-one million, one hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •