Base | Representation |
---|---|
bin | 11011100010011001100001… |
… | …111000100100100001100111 |
3 | 120212211002222212222000121011 |
4 | 123202121201320210201213 |
5 | 111333241043242012411 |
6 | 1105325403545403051 |
7 | 34336663463501233 |
oct | 3342314170444147 |
9 | 525732885860534 |
10 | 121111130032231 |
11 | 35653a3a5a7149 |
12 | 11700194499487 |
13 | 5276966059921 |
14 | 21c9b4a7b55c3 |
15 | e005a22cdc21 |
hex | 6e2661e24867 |
121111130032231 has 32 divisors (see below), whose sum is σ = 134052648468480. Its totient is φ = 108909461606400.
The previous prime is 121111130032187. The next prime is 121111130032241. The reversal of 121111130032231 is 132230031111121.
It is a cyclic number.
It is not a de Polignac number, because 121111130032231 - 215 = 121111129999463 is a prime.
It is a super-2 number, since 2×1211111300322312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111130032241) 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, 1762581966 + ... + 1762650676.
It is an arithmetic number, because the mean of its divisors is an integer number (4189145264640).
Almost surely, 2121111130032231 is an apocalyptic number.
121111130032231 is a deficient number, since it is larger than the sum of its proper divisors (12941518436249).
121111130032231 is a wasteful number, since it uses less digits than its factorization.
121111130032231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111175.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 121111130032231 its reverse (132230031111121), we get a palindrome (253341161143352).
The spelling of 121111130032231 in words is "one hundred twenty-one trillion, one hundred eleven billion, one hundred thirty million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •