Base | Representation |
---|---|
bin | 101111100000011101… |
… | …1101001110100111111 |
3 | 100202100000201102110111 |
4 | 1133000323221310333 |
5 | 3132414401023403 |
6 | 114511242250451 |
7 | 10241115064462 |
oct | 1370073516477 |
9 | 322300642414 |
10 | 102021111103 |
11 | 3a2a329185a |
12 | 179327b6a27 |
13 | 980b468b82 |
14 | 4d1b6532d9 |
15 | 29c18bc56d |
hex | 17c0ee9d3f |
102021111103 has 8 divisors (see below), whose sum is σ = 104515832736. Its totient is φ = 99526694400.
The previous prime is 102021111029. The next prime is 102021111139. The reversal of 102021111103 is 301111120201.
It is a happy number.
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 102021111103 - 29 = 102021110591 is a prime.
It is a super-2 number, since 2×1020211111032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021111163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 695398 + ... + 829228.
It is an arithmetic number, because the mean of its divisors is an integer number (13064479092).
Almost surely, 2102021111103 is an apocalyptic number.
102021111103 is a deficient number, since it is larger than the sum of its proper divisors (2494721633).
102021111103 is a wasteful number, since it uses less digits than its factorization.
102021111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152465.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 102021111103 its reverse (301111120201), we get a palindrome (403132231304).
The spelling of 102021111103 in words is "one hundred two billion, twenty-one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •