Base | Representation |
---|---|
bin | 1100000111010100110111… |
… | …1111101000011000101110 |
3 | 1202011101020211221002001100 |
4 | 3001311031333220120232 |
5 | 3221213331020023042 |
6 | 44155042520223530 |
7 | 2543224032562365 |
oct | 301651577503056 |
9 | 52141224832040 |
10 | 13320002111022 |
11 | 4275a87a38062 |
12 | 15b160990aba6 |
13 | 7580bc750779 |
14 | 34099783c7dc |
15 | 18173cd7c24c |
hex | c1d4dfe862e |
13320002111022 has 96 divisors (see below), whose sum is σ = 29773166911488. Its totient is φ = 4301228288448.
The previous prime is 13320002111021. The next prime is 13320002111033. The reversal of 13320002111022 is 22011120002331.
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 = 13320002110986 and 13320002111004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320002111021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 335471223 + ... + 335510925.
It is an arithmetic number, because the mean of its divisors is an integer number (310137155328).
Almost surely, 213320002111022 is an apocalyptic number.
13320002111022 is an abundant number, since it is smaller than the sum of its proper divisors (16453164800466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320002111022 is a wasteful number, since it uses less digits than its factorization.
13320002111022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43294 (or 43291 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13320002111022 its reverse (22011120002331), we get a palindrome (35331122113353).
The spelling of 13320002111022 in words is "thirteen trillion, three hundred twenty billion, two million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •