Base | Representation |
---|---|
bin | 1001001101111001000110… |
… | …0000010000000011010110 |
3 | 1022212211022122001021012020 |
4 | 2103132101200100003112 |
5 | 2312014440331030232 |
6 | 33315341403434010 |
7 | 2064114430131411 |
oct | 223362140200326 |
9 | 38784278037166 |
10 | 10134269001942 |
11 | 3257a12719528 |
12 | 117810a225906 |
13 | 5868715b81b7 |
14 | 270703572b78 |
15 | 128937965e2c |
hex | 937918100d6 |
10134269001942 has 8 divisors (see below), whose sum is σ = 20268538003896. Its totient is φ = 3378089667312.
The previous prime is 10134269001929. The next prime is 10134269001943. The reversal of 10134269001942 is 24910096243101.
It is a sphenic number, since it is the product of 3 distinct primes.
10134269001942 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10134269001894 and 10134269001903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10134269001943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 844522416823 + ... + 844522416834.
It is an arithmetic number, because the mean of its divisors is an integer number (2533567250487).
Almost surely, 210134269001942 is an apocalyptic number.
10134269001942 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.
10134269001942 is a wasteful number, since it uses less digits than its factorization.
10134269001942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1689044833662.
The product of its (nonzero) digits is 93312, while the sum is 42.
The spelling of 10134269001942 in words is "ten trillion, one hundred thirty-four billion, two hundred sixty-nine million, one thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •