Base | Representation |
---|---|
bin | 1011110110011101011001… |
… | …0011110101010010110101 |
3 | 1201010200022020002022112020 |
4 | 2331213112103311102311 |
5 | 3201441403210111041 |
6 | 43414001114543353 |
7 | 2513255164601541 |
oct | 275472623652265 |
9 | 51120266068466 |
10 | 13030231332021 |
11 | 41740a9986a12 |
12 | 156541a137b59 |
13 | 73698cc57b67 |
14 | 33094908aa21 |
15 | 178e2d758866 |
hex | bd9d64f54b5 |
13030231332021 has 8 divisors (see below), whose sum is σ = 17373754844064. Its totient is φ = 8686764354000.
The previous prime is 13030231331959. The next prime is 13030231332049. The reversal of 13030231332021 is 12023313203031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13030231332021 - 214 = 13030231315637 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13030231331982 and 13030231332000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13030231332061) 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, 13592751 + ... + 14519756.
It is an arithmetic number, because the mean of its divisors is an integer number (2171719355508).
Almost surely, 213030231332021 is an apocalyptic number.
It is an amenable number.
13030231332021 is a deficient number, since it is larger than the sum of its proper divisors (4343523512043).
13030231332021 is a wasteful number, since it uses less digits than its factorization.
13030231332021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28267011.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 13030231332021 its reverse (12023313203031), we get a palindrome (25053544535052).
The spelling of 13030231332021 in words is "thirteen trillion, thirty billion, two hundred thirty-one million, three hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •