Base | Representation |
---|---|
bin | 10111001100011101001001… |
… | …011110101001111011001111 |
3 | 111101012011020001112002211002 |
4 | 113030131021132221323033 |
5 | 101332322012230120421 |
6 | 1000543112405450515 |
7 | 30326023462602251 |
oct | 2714351136517317 |
9 | 441164201462732 |
10 | 102011001020111 |
11 | 2a55a693722217 |
12 | b5364b9a10a3b |
13 | 44bc7998a1071 |
14 | 1b29504759cd1 |
15 | bbd81848db0b |
hex | 5cc7497a9ecf |
102011001020111 has 8 divisors (see below), whose sum is σ = 102698103063600. Its totient is φ = 101323931836288.
The previous prime is 102011001020101. The next prime is 102011001020143. The reversal of 102011001020111 is 111020100110201.
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 102011001020111 - 234 = 101993821150927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102011001020092 and 102011001020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011001020101) 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, 1969181 + ... + 14418726.
It is an arithmetic number, because the mean of its divisors is an integer number (12837262882950).
Almost surely, 2102011001020111 is an apocalyptic number.
102011001020111 is a deficient number, since it is larger than the sum of its proper divisors (687102043489).
102011001020111 is a wasteful number, since it uses less digits than its factorization.
102011001020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16429833.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102011001020111 its reverse (111020100110201), we get a palindrome (213031101130312).
The spelling of 102011001020111 in words is "one hundred two trillion, eleven billion, one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •