Base | Representation |
---|---|
bin | 1011000111010011011011… |
… | …0010010111011111110111 |
3 | 1121021020012212012000010201 |
4 | 2301310312302113133313 |
5 | 3100203231342131411 |
6 | 41553500441101331 |
7 | 2400605332523521 |
oct | 261646662273767 |
9 | 47236185160121 |
10 | 12220101130231 |
11 | 3991574568725 |
12 | 1454407187847 |
13 | 6a8473334757 |
14 | 30365558ca11 |
15 | 162d15e3a3c1 |
hex | b1d36c977f7 |
12220101130231 has 32 divisors (see below), whose sum is σ = 12463848936000. Its totient is φ = 11979413913600.
The previous prime is 12220101130219. The next prime is 12220101130241. The reversal of 12220101130231 is 13203110102221.
It is a cyclic number.
It is not a de Polignac number, because 12220101130231 - 219 = 12220100605943 is a prime.
It is a super-2 number, since 2×122201011302312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12220101130199 and 12220101130208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220101130241) 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, 8421847056 + ... + 8421848506.
It is an arithmetic number, because the mean of its divisors is an integer number (389495279250).
Almost surely, 212220101130231 is an apocalyptic number.
12220101130231 is a deficient number, since it is larger than the sum of its proper divisors (243747805769).
12220101130231 is a wasteful number, since it uses less digits than its factorization.
12220101130231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3379.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12220101130231 its reverse (13203110102221), we get a palindrome (25423211232452).
The spelling of 12220101130231 in words is "twelve trillion, two hundred twenty billion, one hundred one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •