Base | Representation |
---|---|
bin | 10111001111001111000001… |
… | …111001111100010001101111 |
3 | 111101212102020002210121010101 |
4 | 113033033001321330101233 |
5 | 101343434144000000421 |
6 | 1001210541200451531 |
7 | 30345564556256404 |
oct | 2717170171742157 |
9 | 441772202717111 |
10 | 102202000000111 |
11 | 2a623696665910 |
12 | b567523019ba7 |
13 | 45047b81738ab |
14 | 1b3486323c2ab |
15 | bc37965d4191 |
hex | 5cf3c1e7c46f |
102202000000111 has 64 divisors (see below), whose sum is σ = 118141806182400. Its totient is φ = 87542851334400.
The previous prime is 102202000000033. The next prime is 102202000000127. The reversal of 102202000000111 is 111000000202201.
It is not a de Polignac number, because 102202000000111 - 215 = 102201999967343 is a prime.
It is a super-3 number, since 3×1022020000001113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202000009111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 20282196330 + ... + 20282201368.
It is an arithmetic number, because the mean of its divisors is an integer number (1845965721600).
Almost surely, 2102202000000111 is an apocalyptic number.
102202000000111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102202000000111 is a deficient number, since it is larger than the sum of its proper divisors (15939806182289).
102202000000111 is a wasteful number, since it uses less digits than its factorization.
102202000000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9260.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102202000000111 its reverse (111000000202201), we get a palindrome (213202000202312).
The spelling of 102202000000111 in words is "one hundred two trillion, two hundred two billion, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •