Base | Representation |
---|---|
bin | 1100000110001010011100… |
… | …0010100101001010110110 |
3 | 1202002110200100100122102100 |
4 | 3001202213002211022312 |
5 | 3220401420413020042 |
6 | 44141540112322530 |
7 | 2541615632034015 |
oct | 301424702451266 |
9 | 52073610318370 |
10 | 13300021220022 |
11 | 426856427a9a9 |
12 | 15a9772243446 |
13 | 756257006844 |
14 | 33da1dccca7c |
15 | 180e6db3824c |
hex | c18a70a52b6 |
13300021220022 has 48 divisors (see below), whose sum is σ = 28854903168000. Its totient is φ = 4427466359472.
The previous prime is 13300021219981. The next prime is 13300021220033. The reversal of 13300021220022 is 22002212000331.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13300021219977 and 13300021220004.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 121652379 + ... + 121761657.
It is an arithmetic number, because the mean of its divisors is an integer number (601143816000).
Almost surely, 213300021220022 is an apocalyptic number.
13300021220022 is an abundant number, since it is smaller than the sum of its proper divisors (15554881947978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13300021220022 is a wasteful number, since it uses less digits than its factorization.
13300021220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118185 (or 118182 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 13300021220022 its reverse (22002212000331), we get a palindrome (35302233220353).
The spelling of 13300021220022 in words is "thirteen trillion, three hundred billion, twenty-one million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •