Base | Representation |
---|---|
bin | 1011000111010110110100… |
… | …1001010101100100010110 |
3 | 1121021022120102020221200210 |
4 | 2301311231021111210112 |
5 | 3100212113324340202 |
6 | 41554131140150250 |
7 | 2400640045363566 |
oct | 261655511254426 |
9 | 47238512227623 |
10 | 12221013121302 |
11 | 39919a2340057 |
12 | 1454620698386 |
13 | 6a858a26903b |
14 | 30370074ada6 |
15 | 162d6b034c6c |
hex | b1d6d255916 |
12221013121302 has 32 divisors (see below), whose sum is σ = 24532802784000. Its totient is φ = 4058566082208.
The previous prime is 12221013121301. The next prime is 12221013121319. The reversal of 12221013121302 is 20312131012221.
12221013121302 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×122210131213022 (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 (12221013121301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1059052 + ... + 5056047.
It is an arithmetic number, because the mean of its divisors is an integer number (766650087000).
Almost surely, 212221013121302 is an apocalyptic number.
12221013121302 is an abundant number, since it is smaller than the sum of its proper divisors (12311789662698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12221013121302 is a wasteful number, since it uses less digits than its factorization.
12221013121302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6116340.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12221013121302 its reverse (20312131012221), we get a palindrome (32533144133523).
The spelling of 12221013121302 in words is "twelve trillion, two hundred twenty-one billion, thirteen million, one hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •