Base | Representation |
---|---|
bin | 10111001101101111101110… |
… | …010111000100101000111101 |
3 | 111101111122002022111012122212 |
4 | 113031233232113010220331 |
5 | 101340300104123301231 |
6 | 1001051534521150205 |
7 | 30335312630006345 |
oct | 2715575627045075 |
9 | 441448068435585 |
10 | 102099666618941 |
11 | 2a594253089a22 |
12 | b54b72392b365 |
13 | 44c7c5a102044 |
14 | 1b2d91633dd25 |
15 | bc0ca75d242b |
hex | 5cdbee5c4a3d |
102099666618941 has 8 divisors (see below), whose sum is σ = 102270145889280. Its totient is φ = 101929200124752.
The previous prime is 102099666618853. The next prime is 102099666618953. The reversal of 102099666618941 is 149816666990201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102099666618941 is a prime.
It is a super-2 number, since 2×1020996666189412 (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 (102099666618991) 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, 12869540 + ... + 19230818.
It is an arithmetic number, because the mean of its divisors is an integer number (12783768236160).
Almost surely, 2102099666618941 is an apocalyptic number.
It is an amenable number.
102099666618941 is a deficient number, since it is larger than the sum of its proper divisors (170479270339).
102099666618941 is an equidigital number, since it uses as much as digits as its factorization.
102099666618941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6388075.
The product of its (nonzero) digits is 60466176, while the sum is 68.
The spelling of 102099666618941 in words is "one hundred two trillion, ninety-nine billion, six hundred sixty-six million, six hundred eighteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •