Base | Representation |
---|---|
bin | 1100000110111011100101… |
… | …0001011101001000001110 |
3 | 1202010201201122011020221011 |
4 | 3001232321101131020032 |
5 | 3221110424233323042 |
6 | 44152001040555434 |
7 | 2542563542642440 |
oct | 301567121351016 |
9 | 52121648136834 |
10 | 13313212011022 |
11 | 4273113118470 |
12 | 15b0233922b7a |
13 | 757579a8a011 |
14 | 340511b20490 |
15 | 181491bc5a17 |
hex | c1bb945d20e |
13313212011022 has 16 divisors (see below), whose sum is σ = 24897435449472. Its totient is φ = 5186965718520.
The previous prime is 13313212010999. The next prime is 13313212011037. The reversal of 13313212011022 is 22011021231331.
It is a super-2 number, since 2×133132120110222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 13313212010984 and 13313212011002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43224714168 + ... + 43224714475.
It is an arithmetic number, because the mean of its divisors is an integer number (1556089715592).
Almost surely, 213313212011022 is an apocalyptic number.
13313212011022 is a deficient number, since it is larger than the sum of its proper divisors (11584223438450).
13313212011022 is a wasteful number, since it uses less digits than its factorization.
13313212011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86449428663.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13313212011022 its reverse (22011021231331), we get a palindrome (35324233242353).
The spelling of 13313212011022 in words is "thirteen trillion, three hundred thirteen billion, two hundred twelve million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •