Base | Representation |
---|---|
bin | 10111001111100001110000… |
… | …101000000111110111111001 |
3 | 111101221100010200120222000222 |
4 | 113033201300220013313321 |
5 | 101344301340432223001 |
6 | 1001224104541505425 |
7 | 30350206131610325 |
oct | 2717416050076771 |
9 | 441840120528028 |
10 | 102222111211001 |
11 | 2a631176943261 |
12 | b56b3b6272275 |
13 | 45066718b8a92 |
14 | 1b358101d2985 |
15 | bc4071ebb61b |
hex | 5cf870a07df9 |
102222111211001 has 8 divisors (see below), whose sum is σ = 109850626974240. Its totient is φ = 94773089936448.
The previous prime is 102222111210979. The next prime is 102222111211063. The reversal of 102222111211001 is 100112111222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102222111211001 - 242 = 97824064699897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (102222111211901) 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, 44873620991 + ... + 44873623268.
It is an arithmetic number, because the mean of its divisors is an integer number (13731328371780).
Almost surely, 2102222111211001 is an apocalyptic number.
It is an amenable number.
102222111211001 is a deficient number, since it is larger than the sum of its proper divisors (7628515763239).
102222111211001 is an equidigital number, since it uses as much as digits as its factorization.
102222111211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89747244343.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102222111211001 its reverse (100112111222201), we get a palindrome (202334222433202).
The spelling of 102222111211001 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred eleven million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •