Base | Representation |
---|---|
bin | 1001001110010111010000… |
… | …1010010111110111100001 |
3 | 1022220121012222020000122220 |
4 | 2103211310022113313201 |
5 | 2312133031331141423 |
6 | 33323201112421253 |
7 | 2064522205120200 |
oct | 223456412276741 |
9 | 38817188200586 |
10 | 10142366662113 |
11 | 326039862a464 |
12 | 11797aa0a7829 |
13 | 587562132aaa |
14 | 270c70bbd237 |
15 | 128c5d8029e3 |
hex | 93974297de1 |
10142366662113 has 48 divisors (see below), whose sum is σ = 15746145875136. Its totient is φ = 5790067409280.
The previous prime is 10142366662111. The next prime is 10142366662121. The reversal of 10142366662113 is 31126666324101.
It is a happy number.
It is not a de Polignac number, because 10142366662113 - 21 = 10142366662111 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10142366662111) 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 47 ways as a sum of consecutive naturals, for example, 846531583 + ... + 846543563.
It is an arithmetic number, because the mean of its divisors is an integer number (328044705732).
Almost surely, 210142366662113 is an apocalyptic number.
It is an amenable number.
10142366662113 is a deficient number, since it is larger than the sum of its proper divisors (5603779213023).
10142366662113 is a wasteful number, since it uses less digits than its factorization.
10142366662113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17054 (or 17047 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 42.
The spelling of 10142366662113 in words is "ten trillion, one hundred forty-two billion, three hundred sixty-six million, six hundred sixty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •