Base | Representation |
---|---|
bin | 111000010110011000… |
… | …1010110101111101101 |
3 | 102120100102002002211111 |
4 | 1300230301112233231 |
5 | 3440312104020023 |
6 | 131331420552021 |
7 | 11512513620154 |
oct | 1605461265755 |
9 | 376312062744 |
10 | 121010220013 |
11 | 473581293a1 |
12 | 1b5520b2611 |
13 | b5465922a7 |
14 | 5bdd59459b |
15 | 3233a0500d |
hex | 1c2cc56bed |
121010220013 has 4 divisors (see below), whose sum is σ = 121031165440. Its totient is φ = 120989274588.
The previous prime is 121010219989. The next prime is 121010220017. The reversal of 121010220013 is 310022010121.
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 a de Polignac number, because none of the positive numbers 2k-121010220013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121010219975 and 121010220002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121010220017) 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, 10464045 + ... + 10475602.
It is an arithmetic number, because the mean of its divisors is an integer number (30257791360).
Almost surely, 2121010220013 is an apocalyptic number.
It is an amenable number.
121010220013 is a deficient number, since it is larger than the sum of its proper divisors (20945427).
121010220013 is an equidigital number, since it uses as much as digits as its factorization.
121010220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20945426.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 121010220013 its reverse (310022010121), we get a palindrome (431032230134).
The spelling of 121010220013 in words is "one hundred twenty-one billion, ten million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •