Base | Representation |
---|---|
bin | 1100000001100100110100… |
… | …0111010100110101111110 |
3 | 1201210221020101011110012210 |
4 | 3000121031013110311332 |
5 | 3213104010443244402 |
6 | 44041423054441250 |
7 | 2533125511063461 |
oct | 300311507246576 |
9 | 51727211143183 |
10 | 13221203103102 |
11 | 42380985260a5 |
12 | 1596436203226 |
13 | 74b9a59c1c37 |
14 | 339ca40c92d8 |
15 | 17dda92c706c |
hex | c064d1d4d7e |
13221203103102 has 16 divisors (see below), whose sum is σ = 26442450283392. Its totient is φ = 4407060354840.
The previous prime is 13221203103083. The next prime is 13221203103103. The reversal of 13221203103102 is 20130130212231.
13221203103102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×132212031031022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13221203103103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3072063 + ... + 5989989.
It is an arithmetic number, because the mean of its divisors is an integer number (1652653142712).
Almost surely, 213221203103102 is an apocalyptic number.
13221203103102 is an abundant number, since it is smaller than the sum of its proper divisors (13221247180290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13221203103102 is a wasteful number, since it uses less digits than its factorization.
13221203103102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3673103.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13221203103102 its reverse (20130130212231), we get a palindrome (33351333315333).
The spelling of 13221203103102 in words is "thirteen trillion, two hundred twenty-one billion, two hundred three million, one hundred three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •