Base | Representation |
---|---|
bin | 101111101001011011… |
… | …1111010110101110111 |
3 | 100210010000010100221001 |
4 | 1133102313322311313 |
5 | 3134023430401403 |
6 | 115001154104131 |
7 | 10251431454535 |
oct | 1372267726567 |
9 | 323100110831 |
10 | 102322122103 |
11 | 3a438196883 |
12 | 179b757b047 |
13 | 985892bba6 |
14 | 4d4960b155 |
15 | 29dd02ac1d |
hex | 17d2dfad77 |
102322122103 has 4 divisors (see below), whose sum is σ = 108341070480. Its totient is φ = 96303173728.
The previous prime is 102322122061. The next prime is 102322122113. The reversal of 102322122103 is 301221223201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301221223201 = 5689 ⋅52948009.
It is a cyclic number.
It is not a de Polignac number, because 102322122103 - 213 = 102322113911 is a prime.
It is a super-2 number, since 2×1023221221032 (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 (102322122113) 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, 3009474163 + ... + 3009474196.
It is an arithmetic number, because the mean of its divisors is an integer number (27085267620).
Almost surely, 2102322122103 is an apocalyptic number.
102322122103 is a deficient number, since it is larger than the sum of its proper divisors (6018948377).
102322122103 is an equidigital number, since it uses as much as digits as its factorization.
102322122103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6018948376.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102322122103 its reverse (301221223201), we get a palindrome (403543345304).
The spelling of 102322122103 in words is "one hundred two billion, three hundred twenty-two million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •