Base | Representation |
---|---|
bin | 111000010110101111… |
… | …1011100101100110111 |
3 | 102120101020210222121200 |
4 | 1300231133130230313 |
5 | 3440323202144111 |
6 | 131332531543543 |
7 | 11513021413500 |
oct | 1605537345467 |
9 | 376336728550 |
10 | 121022303031 |
11 | 47363a31563 |
12 | 1b55615abb3 |
13 | b548c32cc6 |
14 | 5c0101bba7 |
15 | 3234ae0256 |
hex | 1c2d7dcb37 |
121022303031 has 72 divisors (see below), whose sum is σ = 204305721984. Its totient is φ = 68831713440.
The previous prime is 121022302997. The next prime is 121022303063. The reversal of 121022303031 is 130303220121.
It is not a de Polignac number, because 121022303031 - 210 = 121022302007 is a prime.
It is a super-2 number, since 2×1210223030312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121022302995 and 121022303013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121022403031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 149225616 + ... + 149226426.
It is an arithmetic number, because the mean of its divisors is an integer number (2837579472).
Almost surely, 2121022303031 is an apocalyptic number.
121022303031 is a deficient number, since it is larger than the sum of its proper divisors (83283418953).
121022303031 is a wasteful number, since it uses less digits than its factorization.
121022303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2001 (or 1991 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 121022303031 its reverse (130303220121), we get a palindrome (251325523152).
The spelling of 121022303031 in words is "one hundred twenty-one billion, twenty-two million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •