Base | Representation |
---|---|
bin | 11011100000111100011110… |
… | …110110101101011100111111 |
3 | 120212110120010001220122212220 |
4 | 123200330132312231130333 |
5 | 111330121440113120411 |
6 | 1105211442041100423 |
7 | 34326525604565553 |
oct | 3340743666553477 |
9 | 525416101818786 |
10 | 121011221223231 |
11 | 35615630696209 |
12 | 116a4951187713 |
13 | 526a4033c8271 |
14 | 21c4d8d8d1863 |
15 | decba60a8b06 |
hex | 6e0f1edad73f |
121011221223231 has 8 divisors (see below), whose sum is σ = 161349524182704. Its totient is φ = 80673532872960.
The previous prime is 121011221223229. The next prime is 121011221223271. The reversal of 121011221223231 is 132322122110121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121011221223231 - 21 = 121011221223229 is a prime.
It is a super-2 number, since 2×1210112212232312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011221223271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153192690 + ... + 153980591.
It is an arithmetic number, because the mean of its divisors is an integer number (20168690522838).
Almost surely, 2121011221223231 is an apocalyptic number.
121011221223231 is a deficient number, since it is larger than the sum of its proper divisors (40338302959473).
121011221223231 is a wasteful number, since it uses less digits than its factorization.
121011221223231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 307304601.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 121011221223231 its reverse (132322122110121), we get a palindrome (253333343333352).
The spelling of 121011221223231 in words is "one hundred twenty-one trillion, eleven billion, two hundred twenty-one million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •