Base | Representation |
---|---|
bin | 11011100010010000010011… |
… | …010100011011111010011011 |
3 | 120212210011102101020221201210 |
4 | 123202100103110123322123 |
5 | 111333110300313033311 |
6 | 1105321044450114203 |
7 | 34336163113565544 |
oct | 3342202324337233 |
9 | 525704371227653 |
10 | 121101222002331 |
11 | 3564a81579968a |
12 | 116ba28a27b963 |
13 | 5275a4743103c |
14 | 21c948a9534cb |
15 | e001c253b3a6 |
hex | 6e241351be9b |
121101222002331 has 64 divisors (see below), whose sum is σ = 170266688184320. Its totient is φ = 76479735720960.
The previous prime is 121101222002309. The next prime is 121101222002359. The reversal of 121101222002331 is 133200222101121.
It is not a de Polignac number, because 121101222002331 - 27 = 121101222002203 is a prime.
It is a super-2 number, since 2×1211012220023312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121101222002298 and 121101222002307.
It is not an unprimeable number, because it can be changed into a prime (121101222002231) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3676290321 + ... + 3676323261.
It is an arithmetic number, because the mean of its divisors is an integer number (2660417002880).
Almost surely, 2121101222002331 is an apocalyptic number.
121101222002331 is a deficient number, since it is larger than the sum of its proper divisors (49165466181989).
121101222002331 is a wasteful number, since it uses less digits than its factorization.
121101222002331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38876.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 121101222002331 its reverse (133200222101121), we get a palindrome (254301444103452).
The spelling of 121101222002331 in words is "one hundred twenty-one trillion, one hundred one billion, two hundred twenty-two million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •