Base | Representation |
---|---|
bin | 101111101001011011… |
… | …1011111101110001111 |
3 | 100210002222220201112222 |
4 | 1133102313133232033 |
5 | 3134023413323043 |
6 | 115001151445555 |
7 | 10251430512641 |
oct | 1372267375617 |
9 | 323088821488 |
10 | 102322011023 |
11 | 3a438120381 |
12 | 179b75268bb |
13 | 98588c046b |
14 | 4d495bc891 |
15 | 29dd007d68 |
hex | 17d2ddfb8f |
102322011023 has 4 divisors (see below), whose sum is σ = 105622721088. Its totient is φ = 99021300960.
The previous prime is 102322011017. The next prime is 102322011053. The reversal of 102322011023 is 320110223201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320110223201 = 881 ⋅363348721.
It is a cyclic number.
It is not a de Polignac number, because 102322011023 - 214 = 102321994639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102322010992 and 102322011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102322011053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1650354986 + ... + 1650355047.
It is an arithmetic number, because the mean of its divisors is an integer number (26405680272).
Almost surely, 2102322011023 is an apocalyptic number.
102322011023 is a deficient number, since it is larger than the sum of its proper divisors (3300710065).
102322011023 is an equidigital number, since it uses as much as digits as its factorization.
102322011023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3300710064.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102322011023 its reverse (320110223201), we get a palindrome (422432234224).
The spelling of 102322011023 in words is "one hundred two billion, three hundred twenty-two million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.398 sec. • engine limits •