Base | Representation |
---|---|
bin | 1110000110111011000111… |
… | …01111011001110111101001 |
3 | 11001211212221101100220100022 |
4 | 13003131203233121313221 |
5 | 13031300101332300441 |
6 | 145552155250250225 |
7 | 6351266101125554 |
oct | 703354357316751 |
9 | 131755841326308 |
10 | 31024222150121 |
11 | 9981331670932 |
12 | 3590851286975 |
13 | 1440757a453a5 |
14 | 79381a73969b |
15 | 38c027cb384b |
hex | 1c3763bd9de9 |
31024222150121 has 4 divisors (see below), whose sum is σ = 31314168151632. Its totient is φ = 30734276148612.
The previous prime is 31024222150027. The next prime is 31024222150127. The reversal of 31024222150121 is 12105122242013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31024222150121 - 234 = 31007042280937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31024222150127) 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, 144973000595 + ... + 144973000808.
It is an arithmetic number, because the mean of its divisors is an integer number (7828542037908).
Almost surely, 231024222150121 is an apocalyptic number.
It is an amenable number.
31024222150121 is a deficient number, since it is larger than the sum of its proper divisors (289946001511).
31024222150121 is a wasteful number, since it uses less digits than its factorization.
31024222150121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289946001510.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 31024222150121 its reverse (12105122242013), we get a palindrome (43129344392134).
The spelling of 31024222150121 in words is "thirty-one trillion, twenty-four billion, two hundred twenty-two million, one hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •