Base | Representation |
---|---|
bin | 111000010110101101… |
… | …0100011111100111101 |
3 | 102120101011101220101120 |
4 | 1300231122203330331 |
5 | 3440322340201023 |
6 | 131332444301153 |
7 | 11513004466653 |
oct | 1605532437475 |
9 | 376334356346 |
10 | 121021022013 |
11 | 47363237071 |
12 | 1b5558417b9 |
13 | b5488a4bc8 |
14 | 5c00ba6dd3 |
15 | 323493a8e3 |
hex | 1c2d6a3f3d |
121021022013 has 8 divisors (see below), whose sum is σ = 161848860576. Its totient is φ = 80436932400.
The previous prime is 121021021973. The next prime is 121021022053. The reversal of 121021022013 is 310220120121.
It is an interprime number because it is at equal distance from previous prime (121021021973) and next prime (121021022053).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121021022013 - 28 = 121021021757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121021021983 and 121021022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121021022053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60936078 + ... + 60938063.
It is an arithmetic number, because the mean of its divisors is an integer number (20231107572).
Almost surely, 2121021022013 is an apocalyptic number.
It is an amenable number.
121021022013 is a deficient number, since it is larger than the sum of its proper divisors (40827838563).
121021022013 is a wasteful number, since it uses less digits than its factorization.
121021022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121874475.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 121021022013 its reverse (310220120121), we get a palindrome (431241142134).
The spelling of 121021022013 in words is "one hundred twenty-one billion, twenty-one million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •