Base | Representation |
---|---|
bin | 1011110101111000000110… |
… | …0110111001011111110101 |
3 | 1201002201110112121211020110 |
4 | 2331132001212321133311 |
5 | 3201310402401111041 |
6 | 43405223500253233 |
7 | 2512452124523610 |
oct | 275360146713765 |
9 | 51081415554213 |
10 | 13020220332021 |
11 | 416a931a394a1 |
12 | 15634a5541219 |
13 | 735a55bb8916 |
14 | 3302796a3177 |
15 | 178a44926516 |
hex | bd7819b97f5 |
13020220332021 has 16 divisors (see below), whose sum is σ = 19923349708800. Its totient is φ = 7408995667248.
The previous prime is 13020220331971. The next prime is 13020220332059. The reversal of 13020220332021 is 12023302202031.
It is a happy number.
It is not a de Polignac number, because 13020220332021 - 213 = 13020220323829 is a prime.
It is a super-2 number, since 2×130202203320212 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020220334021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1297088061 + ... + 1297098098.
It is an arithmetic number, because the mean of its divisors is an integer number (1245209356800).
Almost surely, 213020220332021 is an apocalyptic number.
It is an amenable number.
13020220332021 is a deficient number, since it is larger than the sum of its proper divisors (6903129376779).
13020220332021 is a wasteful number, since it uses less digits than its factorization.
13020220332021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2594186408.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13020220332021 its reverse (12023302202031), we get a palindrome (25043522534052).
The spelling of 13020220332021 in words is "thirteen trillion, twenty billion, two hundred twenty million, three hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •