Base | Representation |
---|---|
bin | 10001110001010101010… |
… | …000100111111001001011 |
3 | 11022202010121101021010110 |
4 | 101301111100213321023 |
5 | 130002004442230011 |
6 | 2333002334245403 |
7 | 154141334234550 |
oct | 21612520477113 |
9 | 4282117337113 |
10 | 1221201133131 |
11 | 4309aa226221 |
12 | 178815956863 |
13 | 8b20aa927b5 |
14 | 4316c156a27 |
15 | 21b76117ba6 |
hex | 11c55427e4b |
1221201133131 has 32 divisors (see below), whose sum is σ = 2006594956800. Its totient is φ = 644976933120.
The previous prime is 1221201133043. The next prime is 1221201133133. The reversal of 1221201133131 is 1313311021221.
It is not a de Polignac number, because 1221201133131 - 27 = 1221201133003 is a prime.
It is a super-2 number, since 2×12212011331312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1221201133098 and 1221201133107.
It is not an unprimeable number, because it can be changed into a prime (1221201133133) 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, 37308696 + ... + 37341413.
It is an arithmetic number, because the mean of its divisors is an integer number (62706092400).
Almost surely, 21221201133131 is an apocalyptic number.
1221201133131 is a deficient number, since it is larger than the sum of its proper divisors (785393823669).
1221201133131 is a wasteful number, since it uses less digits than its factorization.
1221201133131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74650179.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1221201133131 its reverse (1313311021221), we get a palindrome (2534512154352).
The spelling of 1221201133131 in words is "one trillion, two hundred twenty-one billion, two hundred one million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •