Base | Representation |
---|---|
bin | 1011110100110100010011… |
… | …0110000100100110011101 |
3 | 1201000222111012102111122121 |
4 | 2331031010312010212131 |
5 | 3201011114340432201 |
6 | 43353013534142541 |
7 | 2511236126153122 |
oct | 275150466044635 |
9 | 51028435374577 |
10 | 13002021030301 |
11 | 4163142a00776 |
12 | 155ba66651a51 |
13 | 7341155b6b34 |
14 | 32d4305d6749 |
15 | 17832bd009a1 |
hex | bd344d8499d |
13002021030301 has 8 divisors (see below), whose sum is σ = 14035165130880. Its totient is φ = 12007863499632.
The previous prime is 13002021030281. The next prime is 13002021030307. The reversal of 13002021030301 is 10303012020031.
13002021030301 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 13002021030301 - 25 = 13002021030269 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 (13002021030307) 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, 9746641785 + ... + 9746643118.
It is an arithmetic number, because the mean of its divisors is an integer number (1754395641360).
Almost surely, 213002021030301 is an apocalyptic number.
It is an amenable number.
13002021030301 is a deficient number, since it is larger than the sum of its proper divisors (1033144100579).
13002021030301 is a wasteful number, since it uses less digits than its factorization.
13002021030301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19493284955.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13002021030301 its reverse (10303012020031), we get a palindrome (23305033050332).
The spelling of 13002021030301 in words is "thirteen trillion, two billion, twenty-one million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •