Base | Representation |
---|---|
bin | 1001110111000110001010… |
… | …0110111000001011011011 |
3 | 1102101111111012102222222210 |
4 | 2131301202212320023123 |
5 | 2410114211331020401 |
6 | 35020452113050203 |
7 | 2166214425555021 |
oct | 235614246701333 |
9 | 42344435388883 |
10 | 10842151813851 |
11 | 3500149054406 |
12 | 1271346856963 |
13 | 608544c17187 |
14 | 296a97758711 |
15 | 13c068abb4d6 |
hex | 9dc629b82db |
10842151813851 has 8 divisors (see below), whose sum is σ = 14654232588880. Its totient is φ = 7129086124032.
The previous prime is 10842151813849. The next prime is 10842151813901. The reversal of 10842151813851 is 15831815124801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10842151813851 - 21 = 10842151813849 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10842151813851.
It is not an unprimeable number, because it can be changed into a prime (10842151811851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24753771046 + ... + 24753771483.
It is an arithmetic number, because the mean of its divisors is an integer number (1831779073610).
Almost surely, 210842151813851 is an apocalyptic number.
10842151813851 is a deficient number, since it is larger than the sum of its proper divisors (3812080775029).
10842151813851 is an equidigital number, since it uses as much as digits as its factorization.
10842151813851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49507542605.
The product of its (nonzero) digits is 307200, while the sum is 48.
The spelling of 10842151813851 in words is "ten trillion, eight hundred forty-two billion, one hundred fifty-one million, eight hundred thirteen thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •