Base | Representation |
---|---|
bin | 101111100101110111… |
… | …0100101010010110111 |
3 | 100202210122112102102101 |
4 | 1133023232211102313 |
5 | 3133302232442124 |
6 | 114541232322531 |
7 | 10245444440623 |
oct | 1371356452267 |
9 | 322718472371 |
10 | 102202234039 |
11 | 3a386551134 |
12 | 179833a3447 |
13 | 9839b43bc9 |
14 | 4d37720183 |
15 | 29d2748644 |
hex | 17cbba54b7 |
102202234039 has 4 divisors (see below), whose sum is σ = 106645809456. Its totient is φ = 97758658624.
The previous prime is 102202234021. The next prime is 102202234049. The reversal of 102202234039 is 930432202201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 930432202201 = 1151 ⋅808368551.
It is a cyclic number.
It is not a de Polignac number, because 102202234039 - 213 = 102202225847 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102202233998 and 102202234016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202234049) 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 3 ways as a sum of consecutive naturals, for example, 2221787674 + ... + 2221787719.
It is an arithmetic number, because the mean of its divisors is an integer number (26661452364).
Almost surely, 2102202234039 is an apocalyptic number.
102202234039 is a deficient number, since it is larger than the sum of its proper divisors (4443575417).
102202234039 is an equidigital number, since it uses as much as digits as its factorization.
102202234039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4443575416.
The product of its (nonzero) digits is 5184, while the sum is 28.
The spelling of 102202234039 in words is "one hundred two billion, two hundred two million, two hundred thirty-four thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •