Base | Representation |
---|---|
bin | 1100001011000… |
… | …01011100101111 |
3 | 21010010202222202 |
4 | 12011201130233 |
5 | 202120023043 |
6 | 14044332115 |
7 | 2346633530 |
oct | 605413457 |
9 | 233122882 |
10 | 102111023 |
11 | 52703583 |
12 | 2a24403b |
13 | 18202631 |
14 | d7c0687 |
15 | 8e701b8 |
hex | 616172f |
102111023 has 8 divisors (see below), whose sum is σ = 116840448. Its totient is φ = 87417144.
The previous prime is 102110971. The next prime is 102111029. The reversal of 102111023 is 320111201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102111023 is a prime.
It is a super-2 number, since 2×1021110232 = 20853322036213058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102110995 and 102111013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111029) 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, 2411 + ... + 14492.
It is an arithmetic number, because the mean of its divisors is an integer number (14605056).
Almost surely, 2102111023 is an apocalyptic number.
102111023 is a deficient number, since it is larger than the sum of its proper divisors (14729425).
102111023 is an equidigital number, since it uses as much as digits as its factorization.
102111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17773.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 102111023 is about 10104.9999010391. Note that the first 4 decimals coincide. The cubic root of 102111023 is about 467.4023329199.
Adding to 102111023 its reverse (320111201), we get a palindrome (422222224).
The spelling of 102111023 in words is "one hundred two million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •