Base | Representation |
---|---|
bin | 11011100000111110010110… |
… | …000011010111110011010010 |
3 | 120212110202021102220102120211 |
4 | 123200332112003113303102 |
5 | 111330140034040443442 |
6 | 1105212412315554334 |
7 | 34326626266640350 |
oct | 3340762603276322 |
9 | 525422242812524 |
10 | 121013221031122 |
11 | 35616467511502 |
12 | 116a520aa5b9aa |
13 | 526a661806044 |
14 | 21c50dd33a7d0 |
15 | decc7192e617 |
hex | 6e0f960d7cd2 |
121013221031122 has 8 divisors (see below), whose sum is σ = 207451236053376. Its totient is φ = 51862809013332.
The previous prime is 121013221031009. The next prime is 121013221031123. The reversal of 121013221031122 is 221130122310121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×1210132210311224 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121013221031093 and 121013221031102.
It is not an unprimeable number, because it can be changed into a prime (121013221031123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4321900751098 + ... + 4321900751125.
It is an arithmetic number, because the mean of its divisors is an integer number (25931404506672).
Almost surely, 2121013221031122 is an apocalyptic number.
121013221031122 is a deficient number, since it is larger than the sum of its proper divisors (86438015022254).
121013221031122 is an equidigital number, since it uses as much as digits as its factorization.
121013221031122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8643801502232.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 121013221031122 its reverse (221130122310121), we get a palindrome (342143343341243).
The spelling of 121013221031122 in words is "one hundred twenty-one trillion, thirteen billion, two hundred twenty-one million, thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •