Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …1000001000010100000011 |
3 | 1022220121100010221011121201 |
4 | 2103211312320020110003 |
5 | 2312133130011231314 |
6 | 33323205421002031 |
7 | 2064523300230133 |
oct | 223456670102403 |
9 | 38817303834551 |
10 | 10142412211459 |
11 | 3260411310350 |
12 | 11798013b3317 |
13 | 58756b6c0478 |
14 | 270c76c78ac3 |
15 | 128c627edb74 |
hex | 93976e08503 |
10142412211459 has 8 divisors (see below), whose sum is σ = 11715299666928. Its totient is φ = 8677999752960.
The previous prime is 10142412211429. The next prime is 10142412211489. The reversal of 10142412211459 is 95411221424101.
It is an interprime number because it is at equal distance from previous prime (10142412211429) and next prime (10142412211489).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10142412211459 - 27 = 10142412211331 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10142412211429) 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 7 ways as a sum of consecutive naturals, for example, 27118749042 + ... + 27118749415.
It is an arithmetic number, because the mean of its divisors is an integer number (1464412458366).
Almost surely, 210142412211459 is an apocalyptic number.
10142412211459 is a deficient number, since it is larger than the sum of its proper divisors (1572887455469).
10142412211459 is a wasteful number, since it uses less digits than its factorization.
10142412211459 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54237498485.
The product of its (nonzero) digits is 23040, while the sum is 37.
The spelling of 10142412211459 in words is "ten trillion, one hundred forty-two billion, four hundred twelve million, two hundred eleven thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •