Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0010001000011110111001 |
3 | 1201002211020212111021100111 |
4 | 2331133002002020132321 |
5 | 3201320111102304423 |
6 | 43405523031304321 |
7 | 2512520661050464 |
oct | 275370202103671 |
9 | 51084225437314 |
10 | 13021301213113 |
11 | 4170337085456 |
12 | 156374751b0a1 |
13 | 735b98b0422b |
14 | 33033d0662db |
15 | 178aa978260d |
hex | bd7c20887b9 |
13021301213113 has 8 divisors (see below), whose sum is σ = 13787752119840. Its totient is φ = 12254904974400.
The previous prime is 13021301213101. The next prime is 13021301213119. The reversal of 13021301213113 is 31131210312031.
13021301213113 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 not a de Polignac number, because 13021301213113 - 213 = 13021301204921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13021301213119) 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, 13176103 + ... + 14129836.
It is an arithmetic number, because the mean of its divisors is an integer number (1723469014980).
Almost surely, 213021301213113 is an apocalyptic number.
It is an amenable number.
13021301213113 is a deficient number, since it is larger than the sum of its proper divisors (766450906727).
13021301213113 is a wasteful number, since it uses less digits than its factorization.
13021301213113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27334007.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13021301213113 its reverse (31131210312031), we get a palindrome (44152511525144).
The spelling of 13021301213113 in words is "thirteen trillion, twenty-one billion, three hundred one million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •