Base | Representation |
---|---|
bin | 10111001101111001100011… |
… | …011100110110001000000101 |
3 | 111101112122022212102101022021 |
4 | 113031321203130312020011 |
5 | 101340433213034014341 |
6 | 1001100442110203141 |
7 | 30336135315534226 |
oct | 2715714334661005 |
9 | 441478285371267 |
10 | 102110221001221 |
11 | 2a598779824604 |
12 | b55178a4b34b1 |
13 | 44c8c4c905564 |
14 | 1b30237d7324d |
15 | bc11c3e9b9d1 |
hex | 5cde63736205 |
102110221001221 has 16 divisors (see below), whose sum is σ = 110340109843200. Its totient is φ = 94187227465728.
The previous prime is 102110221001161. The next prime is 102110221001231. The reversal of 102110221001221 is 122100122011201.
It is a cyclic number.
It is not a de Polignac number, because 102110221001221 - 223 = 102110212612613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102110221001195 and 102110221001204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110221001231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 296058616 + ... + 296403313.
It is an arithmetic number, because the mean of its divisors is an integer number (6896256865200).
Almost surely, 2102110221001221 is an apocalyptic number.
It is an amenable number.
102110221001221 is a deficient number, since it is larger than the sum of its proper divisors (8229888841979).
102110221001221 is a wasteful number, since it uses less digits than its factorization.
102110221001221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 592462188.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102110221001221 its reverse (122100122011201), we get a palindrome (224210343012422).
The spelling of 102110221001221 in words is "one hundred two trillion, one hundred ten billion, two hundred twenty-one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •