Base | Representation |
---|---|
bin | 11011100000111100011001… |
… | …000000000110100100110011 |
3 | 120212110112212020010112022010 |
4 | 123200330121000012210303 |
5 | 111330121234443202011 |
6 | 1105211424212214003 |
7 | 34326523303105146 |
oct | 3340743100064463 |
9 | 525415766115263 |
10 | 121011123022131 |
11 | 35615590213281 |
12 | 116a492430a303 |
13 | 526a3b8c644c4 |
14 | 21c4d8084c05d |
15 | decb9c65c1a6 |
hex | 6e0f19006933 |
121011123022131 has 32 divisors (see below), whose sum is σ = 180331692940800. Its totient is φ = 71731939668480.
The previous prime is 121011123022123. The next prime is 121011123022147. The reversal of 121011123022131 is 131220321110121.
It is not a de Polignac number, because 121011123022131 - 23 = 121011123022123 is a prime.
It is a super-2 number, since 2×1210111230221312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121011123022098 and 121011123022107.
It is not an unprimeable number, because it can be changed into a prime (121011123022331) 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, 173583160 + ... + 174278901.
It is an arithmetic number, because the mean of its divisors is an integer number (5635365404400).
Almost surely, 2121011123022131 is an apocalyptic number.
121011123022131 is a deficient number, since it is larger than the sum of its proper divisors (59320569918669).
121011123022131 is a wasteful number, since it uses less digits than its factorization.
121011123022131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347862459.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 121011123022131 its reverse (131220321110121), we get a palindrome (252231444132252).
The spelling of 121011123022131 in words is "one hundred twenty-one trillion, eleven billion, one hundred twenty-three million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •