Base | Representation |
---|---|
bin | 101111111010000110… |
… | …1100011110000000110 |
3 | 100211112222120210201020 |
4 | 1133310031203300012 |
5 | 3141200122132242 |
6 | 115132454212010 |
7 | 10301332556304 |
oct | 1376415436006 |
9 | 324488523636 |
10 | 102881442822 |
11 | 3a6a498a804 |
12 | 17b32954006 |
13 | 99177839b2 |
14 | 4d9da05274 |
15 | 2a221b06ec |
hex | 17f4363c06 |
102881442822 has 8 divisors (see below), whose sum is σ = 205762885656. Its totient is φ = 34293814272.
The previous prime is 102881442821. The next prime is 102881442823. The reversal of 102881442822 is 228244188201.
It is an interprime number because it is at equal distance from previous prime (102881442821) and next prime (102881442823).
It is a sphenic number, since it is the product of 3 distinct primes.
102881442822 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102881442821) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 8573453563 + ... + 8573453574.
It is an arithmetic number, because the mean of its divisors is an integer number (25720360707).
Almost surely, 2102881442822 is an apocalyptic number.
102881442822 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102881442822 is a wasteful number, since it uses less digits than its factorization.
102881442822 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17146907142.
The product of its (nonzero) digits is 131072, while the sum is 42.
The spelling of 102881442822 in words is "one hundred two billion, eight hundred eighty-one million, four hundred forty-two thousand, eight hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •