Base | Representation |
---|---|
bin | 1011000111010011011011… |
… | …0010101011000000010011 |
3 | 1121021020012212100001201222 |
4 | 2301310312302223000103 |
5 | 3100203231402211011 |
6 | 41553500442515255 |
7 | 2400605333305463 |
oct | 261646662530023 |
9 | 47236185301658 |
10 | 12220101210131 |
11 | 3991574612761 |
12 | 1454407205b2b |
13 | 6a8473361c29 |
14 | 3036555adba3 |
15 | 162d15e53ddb |
hex | b1d36cab013 |
12220101210131 has 4 divisors (see below), whose sum is σ = 12357405718200. Its totient is φ = 12082796702064.
The previous prime is 12220101210127. The next prime is 12220101210157. The reversal of 12220101210131 is 13101210102221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12220101210131 - 22 = 12220101210127 is a prime.
It is a super-2 number, since 2×122201012101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12220101210181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68652253901 + ... + 68652254078.
It is an arithmetic number, because the mean of its divisors is an integer number (3089351429550).
Almost surely, 212220101210131 is an apocalyptic number.
12220101210131 is a deficient number, since it is larger than the sum of its proper divisors (137304508069).
12220101210131 is an equidigital number, since it uses as much as digits as its factorization.
12220101210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137304508068.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12220101210131 its reverse (13101210102221), we get a palindrome (25321311312352).
The spelling of 12220101210131 in words is "twelve trillion, two hundred twenty billion, one hundred one million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •