Base | Representation |
---|---|
bin | 101111111011101000… |
… | …1000111001011111111 |
3 | 100211200120001020122012 |
4 | 1133313101013023333 |
5 | 3141301233043142 |
6 | 115141525041435 |
7 | 10302524364623 |
oct | 1376721071377 |
9 | 324616036565 |
10 | 102932706047 |
11 | 3a720913606 |
12 | 17b47b5627b |
13 | 9925292072 |
14 | 4da674b183 |
15 | 2a26939882 |
hex | 17f74472ff |
102932706047 has 4 divisors (see below), whose sum is σ = 102973090200. Its totient is φ = 102892321896.
The previous prime is 102932706043. The next prime is 102932706061. The reversal of 102932706047 is 740607239201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102932706047 - 22 = 102932706043 is a prime.
It is a super-2 number, since 2×1029327060472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102932705995 and 102932706013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102932706043) 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, 20188253 + ... + 20193350.
It is an arithmetic number, because the mean of its divisors is an integer number (25743272550).
Almost surely, 2102932706047 is an apocalyptic number.
102932706047 is a deficient number, since it is larger than the sum of its proper divisors (40384153).
102932706047 is an equidigital number, since it uses as much as digits as its factorization.
102932706047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40384152.
The product of its (nonzero) digits is 127008, while the sum is 41.
The spelling of 102932706047 in words is "one hundred two billion, nine hundred thirty-two million, seven hundred six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •