Base | Representation |
---|---|
bin | 1001010100010010000000… |
… | …0001110010110010011010 |
3 | 1100021022122100220021200220 |
4 | 2111010200001302302122 |
5 | 2320314240242421132 |
6 | 33442013331540510 |
7 | 2105051502130254 |
oct | 225044001626232 |
9 | 40238570807626 |
10 | 10244034342042 |
11 | 329a51a363136 |
12 | 119544245a736 |
13 | 5940152b3a97 |
14 | 275b57510cd4 |
15 | 12b70e159a2c |
hex | 95120072c9a |
10244034342042 has 8 divisors (see below), whose sum is σ = 20488068684096. Its totient is φ = 3414678114012.
The previous prime is 10244034341909. The next prime is 10244034342053. The reversal of 10244034342042 is 24024343044201.
It is a sphenic number, since it is the product of 3 distinct primes.
10244034342042 is an admirable number.
It is a super-3 number, since 3×102440343420423 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10244034341994 and 10244034342012.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 853669528498 + ... + 853669528509.
It is an arithmetic number, because the mean of its divisors is an integer number (2561008585512).
Almost surely, 210244034342042 is an apocalyptic number.
10244034342042 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.
10244034342042 is a wasteful number, since it uses less digits than its factorization.
10244034342042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1707339057012.
The product of its (nonzero) digits is 73728, while the sum is 33.
Adding to 10244034342042 its reverse (24024343044201), we get a palindrome (34268377386243).
The spelling of 10244034342042 in words is "ten trillion, two hundred forty-four billion, thirty-four million, three hundred forty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •