Base | Representation |
---|---|
bin | 1011110101111111100101… |
… | …1001100100010000111111 |
3 | 1201002220122121100202212110 |
4 | 2331133321121210100333 |
5 | 3201324011401244403 |
6 | 43410155132505103 |
7 | 2512553000352534 |
oct | 275377131442077 |
9 | 51086577322773 |
10 | 13022230103103 |
11 | 417077344a231 |
12 | 156396661b193 |
13 | 735cb63a4590 |
14 | 3303ca582d8b |
15 | 178b110b9103 |
hex | bd7f966443f |
13022230103103 has 32 divisors (see below), whose sum is σ = 18964737792000. Its totient is φ = 7899648583680.
The previous prime is 13022230103027. The next prime is 13022230103111. The reversal of 13022230103103 is 30130103222031.
It is not a de Polignac number, because 13022230103103 - 221 = 13022228005951 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13022230103103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022230103503) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18661023 + ... + 19346271.
It is an arithmetic number, because the mean of its divisors is an integer number (592648056000).
Almost surely, 213022230103103 is an apocalyptic number.
13022230103103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13022230103103 is a deficient number, since it is larger than the sum of its proper divisors (5942507688897).
13022230103103 is a wasteful number, since it uses less digits than its factorization.
13022230103103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692199.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13022230103103 its reverse (30130103222031), we get a palindrome (43152333325134).
The spelling of 13022230103103 in words is "thirteen trillion, twenty-two billion, two hundred thirty million, one hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •