Base | Representation |
---|---|
bin | 10111001111100001110001… |
… | …001010000010010101011001 |
3 | 111101221100011022022122002221 |
4 | 113033201301022002111121 |
5 | 101344301400221214314 |
6 | 1001224105500224041 |
7 | 30350206300305313 |
oct | 2717416112022531 |
9 | 441840138278087 |
10 | 102222120101209 |
11 | 2a631180965639 |
12 | b56b3b923b021 |
13 | 45066736ac464 |
14 | 1b358114687b3 |
15 | bc4072b75824 |
hex | 5cf871282559 |
102222120101209 has 4 divisors (see below), whose sum is σ = 102374010324916. Its totient is φ = 102070229877504.
The previous prime is 102222120101201. The next prime is 102222120101243. The reversal of 102222120101209 is 902101021222201.
It is a happy number.
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 26936650142809 + 75285469958400 = 5190053^2 + 8676720^2 .
It is a cyclic number.
It is not a de Polignac number, because 102222120101209 - 23 = 102222120101201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222120101201) 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, 75945110844 + ... + 75945112189.
It is an arithmetic number, because the mean of its divisors is an integer number (25593502581229).
Almost surely, 2102222120101209 is an apocalyptic number.
It is an amenable number.
102222120101209 is a deficient number, since it is larger than the sum of its proper divisors (151890223707).
102222120101209 is an equidigital number, since it uses as much as digits as its factorization.
102222120101209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151890223706.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 102222120101209 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred twenty million, one hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •