Base | Representation |
---|---|
bin | 101111100001101111… |
… | …1010000010110001001 |
3 | 100202110000102022200212 |
4 | 1133003133100112021 |
5 | 3133011340421340 |
6 | 114515413410505 |
7 | 10242145446251 |
oct | 1370337202611 |
9 | 322400368625 |
10 | 102063998345 |
11 | 3a315514661 |
12 | 17945039a35 |
13 | 981730393a |
14 | 4d23218961 |
15 | 29c553ea65 |
hex | 17c37d0589 |
102063998345 has 8 divisors (see below), whose sum is σ = 122505326664. Its totient is φ = 81632179584.
The previous prime is 102063998339. The next prime is 102063998357. The reversal of 102063998345 is 543899360201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 28486350841 + 73577647504 = 168779^2 + 271252^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102063998345 - 214 = 102063981961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102063998293 and 102063998302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2353754 + ... + 2396723.
It is an arithmetic number, because the mean of its divisors is an integer number (15313165833).
Almost surely, 2102063998345 is an apocalyptic number.
It is an amenable number.
102063998345 is a deficient number, since it is larger than the sum of its proper divisors (20441328319).
102063998345 is an equidigital number, since it uses as much as digits as its factorization.
102063998345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4754779.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 102063998345 in words is "one hundred two billion, sixty-three million, nine hundred ninety-eight thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •