Base | Representation |
---|---|
bin | 101111100011000111… |
… | …0110100001000001111 |
3 | 100202120020000110200201 |
4 | 1133012032310020033 |
5 | 3133110131120421 |
6 | 114524140034331 |
7 | 10243244564431 |
oct | 1370616641017 |
9 | 322506013621 |
10 | 102110020111 |
11 | 3a339498480 |
12 | 179585329a7 |
13 | 98239c8358 |
14 | 4d29398651 |
15 | 29c95d0b91 |
hex | 17c63b420f |
102110020111 has 4 divisors (see below), whose sum is σ = 111392749224. Its totient is φ = 92827291000.
The previous prime is 102110020097. The next prime is 102110020123. The reversal of 102110020111 is 111020011201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102110020111 - 213 = 102110011919 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 (102110020211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4641364540 + ... + 4641364561.
It is an arithmetic number, because the mean of its divisors is an integer number (27848187306).
Almost surely, 2102110020111 is an apocalyptic number.
102110020111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102110020111 is a deficient number, since it is larger than the sum of its proper divisors (9282729113).
102110020111 is an equidigital number, since it uses as much as digits as its factorization.
102110020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9282729112.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102110020111 its reverse (111020011201), we get a palindrome (213130031312).
The spelling of 102110020111 in words is "one hundred two billion, one hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •