Base | Representation |
---|---|
bin | 11011100010010001111110… |
… | …100011111010010101101111 |
3 | 120212210100001202210202001211 |
4 | 123202101332203322111233 |
5 | 111333122441413034411 |
6 | 1105321543201415251 |
7 | 34336255521650650 |
oct | 3342217643722557 |
9 | 525710052722054 |
10 | 121103021221231 |
11 | 3565055936a455 |
12 | 116ba6b093a527 |
13 | 5275c731096ca |
14 | 21c95bb8a5527 |
15 | e0027a48d221 |
hex | 6e247e8fa56f |
121103021221231 has 16 divisors (see below), whose sum is σ = 138471031436800. Its totient is φ = 103751908479648.
The previous prime is 121103021221223. The next prime is 121103021221331. The reversal of 121103021221231 is 132122120301121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121103021221231 - 23 = 121103021221223 is a prime.
It is a super-2 number, since 2×1211030212212312 (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 (121103021221331) 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, 632583481 + ... + 632774893.
It is an arithmetic number, because the mean of its divisors is an integer number (8654439464800).
Almost surely, 2121103021221231 is an apocalyptic number.
121103021221231 is a deficient number, since it is larger than the sum of its proper divisors (17368010215569).
121103021221231 is a wasteful number, since it uses less digits than its factorization.
121103021221231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235078.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 121103021221231 its reverse (132122120301121), we get a palindrome (253225141522352).
The spelling of 121103021221231 in words is "one hundred twenty-one trillion, one hundred three billion, twenty-one million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •