Base | Representation |
---|---|
bin | 1100000110111011100100… |
… | …1101111111000010001010 |
3 | 1202010201201120110001001120 |
4 | 3001232321031333002022 |
5 | 3221110424020220242 |
6 | 44152001005300110 |
7 | 2542563532133316 |
oct | 301567115770212 |
9 | 52121646401046 |
10 | 13313211101322 |
11 | 4273112656a50 |
12 | 15b0233564636 |
13 | 75757982bc32 |
14 | 340511964b46 |
15 | 181491a961ec |
hex | c1bb937f08a |
13313211101322 has 32 divisors (see below), whose sum is σ = 29054422229184. Its totient is φ = 4033276368000.
The previous prime is 13313211101297. The next prime is 13313211101347. The reversal of 13313211101322 is 22310111231331.
It is an interprime number because it is at equal distance from previous prime (13313211101297) and next prime (13313211101347).
It is a junction number, because it is equal to n+sod(n) for n = 13313211101292 and 13313211101301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25490179 + ... + 26007222.
It is an arithmetic number, because the mean of its divisors is an integer number (907950694662).
Almost surely, 213313211101322 is an apocalyptic number.
13313211101322 is an abundant number, since it is smaller than the sum of its proper divisors (15741211127862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13313211101322 is a wasteful number, since it uses less digits than its factorization.
13313211101322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51501334.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 13313211101322 its reverse (22310111231331), we get a palindrome (35623322332653).
The spelling of 13313211101322 in words is "thirteen trillion, three hundred thirteen billion, two hundred eleven million, one hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •