Base | Representation |
---|---|
bin | 10111010101111100101001… |
… | …100100000110010010000101 |
3 | 111110111111220221021100110010 |
4 | 113111330221210012102011 |
5 | 101424013414423330221 |
6 | 1002202511425420433 |
7 | 30424115202565320 |
oct | 2725745144062205 |
9 | 443444827240403 |
10 | 102663300605061 |
11 | 2a791296845a99 |
12 | b620a0379a719 |
13 | 4539152829531 |
14 | 1b4cd048d17b7 |
15 | bd07949dec76 |
hex | 5d5f29906485 |
102663300605061 has 8 divisors (see below), whose sum is σ = 156439315207744. Its totient is φ = 58664743202880.
The previous prime is 102663300605017. The next prime is 102663300605093. The reversal of 102663300605061 is 160506003366201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102663300605061 - 27 = 102663300604933 is a prime.
It is a super-2 number, since 2×1026633006050612 (a number of 29 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 (102663301605061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2444364300100 + ... + 2444364300141.
It is an arithmetic number, because the mean of its divisors is an integer number (19554914400968).
Almost surely, 2102663300605061 is an apocalyptic number.
It is an amenable number.
102663300605061 is a deficient number, since it is larger than the sum of its proper divisors (53776014602683).
102663300605061 is an equidigital number, since it uses as much as digits as its factorization.
102663300605061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4888728600251.
The product of its (nonzero) digits is 116640, while the sum is 39.
The spelling of 102663300605061 in words is "one hundred two trillion, six hundred sixty-three billion, three hundred million, six hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •