Base | Representation |
---|---|
bin | 10111001111011111110011… |
… | …111111100011011011111011 |
3 | 111101221010201221222122211221 |
4 | 113033133303333203123323 |
5 | 101344233100132414321 |
6 | 1001223121244132511 |
7 | 30350103251406013 |
oct | 2717376377433373 |
9 | 441833657878757 |
10 | 102220020201211 |
11 | 2a6302a35956a0 |
12 | b56ab11b37137 |
13 | 45063ca627c93 |
14 | 1b35692606c43 |
15 | bc3e9d62ce41 |
hex | 5cf7f3fe36fb |
102220020201211 has 4 divisors (see below), whose sum is σ = 111512749310424. Its totient is φ = 92927291092000.
The previous prime is 102220020201149. The next prime is 102220020201227. The reversal of 102220020201211 is 112102020022201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102220020201211 - 223 = 102220011812603 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102220020201251) 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, 4646364554590 + ... + 4646364554611.
It is an arithmetic number, because the mean of its divisors is an integer number (27878187327606).
Almost surely, 2102220020201211 is an apocalyptic number.
102220020201211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102220020201211 is a deficient number, since it is larger than the sum of its proper divisors (9292729109213).
102220020201211 is an equidigital number, since it uses as much as digits as its factorization.
102220020201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9292729109212.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102220020201211 its reverse (112102020022201), we get a palindrome (214322040223412).
The spelling of 102220020201211 in words is "one hundred two trillion, two hundred twenty billion, twenty million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •