Base | Representation |
---|---|
bin | 10111001111010000001010… |
… | …101011110001010110011111 |
3 | 111101212112101012100221102102 |
4 | 113033100022223301112133 |
5 | 101343444144040201421 |
6 | 1001211302255315315 |
7 | 30345640043631326 |
oct | 2717201253612637 |
9 | 441775335327372 |
10 | 102203221022111 |
11 | 2a62416291a800 |
12 | b567803b1bb3b |
13 | 4504951118711 |
14 | 1b3493b4810bd |
15 | bc38188c360b |
hex | 5cf40aaf159f |
102203221022111 has 24 divisors (see below), whose sum is σ = 112573287036000. Its totient is φ = 92718371116800.
The previous prime is 102203221022101. The next prime is 102203221022131. The reversal of 102203221022111 is 111220122302201.
It is not a de Polignac number, because 102203221022111 - 222 = 102203216827807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102203221022101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 390660395 + ... + 390921923.
It is an arithmetic number, because the mean of its divisors is an integer number (4690553626500).
Almost surely, 2102203221022111 is an apocalyptic number.
102203221022111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102203221022111 is a deficient number, since it is larger than the sum of its proper divisors (10370066013889).
102203221022111 is a wasteful number, since it uses less digits than its factorization.
102203221022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268271 (or 268260 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 102203221022111 its reverse (111220122302201), we get a palindrome (213423343324312).
The spelling of 102203221022111 in words is "one hundred two trillion, two hundred three billion, two hundred twenty-one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •