Base | Representation |
---|---|
bin | 101111100011001001… |
… | …0101011001011010111 |
3 | 100202120021220212202221 |
4 | 1133012102223023113 |
5 | 3133110411011043 |
6 | 114524213443211 |
7 | 10243256310550 |
oct | 1370622531327 |
9 | 322507825687 |
10 | 102111032023 |
11 | 3a33a019770 |
12 | 17958940507 |
13 | 9823c90b10 |
14 | 4d2957d327 |
15 | 29c97308ed |
hex | 17c64ab2d7 |
102111032023 has 32 divisors (see below), whose sum is σ = 137973588480. Its totient is φ = 72978572160.
The previous prime is 102111031969. The next prime is 102111032027. The reversal of 102111032023 is 320230111201.
It is not a de Polignac number, because 102111032023 - 225 = 102077477591 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102111031988 and 102111032006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111032027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 167713 + ... + 482026.
It is an arithmetic number, because the mean of its divisors is an integer number (4311674640).
Almost surely, 2102111032023 is an apocalyptic number.
102111032023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102111032023 is a deficient number, since it is larger than the sum of its proper divisors (35862556457).
102111032023 is a wasteful number, since it uses less digits than its factorization.
102111032023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649927.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102111032023 its reverse (320230111201), we get a palindrome (422341143224).
The spelling of 102111032023 in words is "one hundred two billion, one hundred eleven million, thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •