Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1100001001010011001 |
3 | 100200021021012011222212 |
4 | 1132101033201022121 |
5 | 3124300034341441 |
6 | 114300021324505 |
7 | 10212231256415 |
oct | 1362117411231 |
9 | 320237164885 |
10 | 101221012121 |
11 | 39a22693629 |
12 | 1774a866735 |
13 | 971177cc18 |
14 | 4c8329dd45 |
15 | 2976525eeb |
hex | 17913e1299 |
101221012121 has 4 divisors (see below), whose sum is σ = 101223187044. Its totient is φ = 101218837200.
The previous prime is 101221012099. The next prime is 101221012153. The reversal of 101221012121 is 121210122101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 89135088025 + 12085924096 = 298555^2 + 109936^2 .
It is a cyclic number.
It is not a de Polignac number, because 101221012121 - 214 = 101220995737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101221012096 and 101221012105.
It is not an unprimeable number, because it can be changed into a prime (101221012021) 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, 1016090 + ... + 1111251.
It is an arithmetic number, because the mean of its divisors is an integer number (25305796761).
Almost surely, 2101221012121 is an apocalyptic number.
It is an amenable number.
101221012121 is a deficient number, since it is larger than the sum of its proper divisors (2174923).
101221012121 is an equidigital number, since it uses as much as digits as its factorization.
101221012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2174922.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221012121 its reverse (121210122101), we get a palindrome (222431134222).
The spelling of 101221012121 in words is "one hundred one billion, two hundred twenty-one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •