Base | Representation |
---|---|
bin | 1011110101111000000100… |
… | …0000011100000100011101 |
3 | 1201002201102211122121022202 |
4 | 2331132001000130010131 |
5 | 3201310342311000023 |
6 | 43405222500221245 |
7 | 2512451643033161 |
oct | 275360100340435 |
9 | 51081384577282 |
10 | 13020210250013 |
11 | 416a92728275a |
12 | 15634a209a825 |
13 | 735a53a98935 |
14 | 3302781daca1 |
15 | 178a43ad4128 |
hex | bd78101c11d |
13020210250013 has 8 divisors (see below), whose sum is σ = 13851441964800. Its totient is φ = 12196238201280.
The previous prime is 13020210249919. The next prime is 13020210250037. The reversal of 13020210250013 is 31005201202031.
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 13020210250013 - 214 = 13020210233629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020210250043) 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 7 ways as a sum of consecutive naturals, for example, 1814912813 + ... + 1814919986.
It is an arithmetic number, because the mean of its divisors is an integer number (1731430245600).
Almost surely, 213020210250013 is an apocalyptic number.
It is an amenable number.
13020210250013 is a deficient number, since it is larger than the sum of its proper divisors (831231714787).
13020210250013 is a wasteful number, since it uses less digits than its factorization.
13020210250013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3629833027.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 13020210250013 its reverse (31005201202031), we get a palindrome (44025411452044).
The spelling of 13020210250013 in words is "thirteen trillion, twenty billion, two hundred ten million, two hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •