Base | Representation |
---|---|
bin | 10011010000111010… |
… | …01011011010111101 |
3 | 222200210002001211212 |
4 | 21220131023122331 |
5 | 132140124222023 |
6 | 4430133454205 |
7 | 514203032351 |
oct | 115035133275 |
9 | 28623061755 |
10 | 10342414013 |
11 | 44280287a8 |
12 | 20077a1365 |
13 | c8a918809 |
14 | 701817461 |
15 | 407e98e78 |
hex | 26874b6bd |
10342414013 has 8 divisors (see below), whose sum is σ = 10505235456. Its totient is φ = 10180069200.
The previous prime is 10342414003. The next prime is 10342414079. The reversal of 10342414013 is 31041424301.
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 10342414013 - 216 = 10342348477 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 10342414013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10342414003) 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, 75293 + ... + 162338.
It is an arithmetic number, because the mean of its divisors is an integer number (1313154432).
Almost surely, 210342414013 is an apocalyptic number.
It is an amenable number.
10342414013 is a deficient number, since it is larger than the sum of its proper divisors (162821443).
10342414013 is an equidigital number, since it uses as much as digits as its factorization.
10342414013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238315.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10342414013 its reverse (31041424301), we get a palindrome (41383838314).
The spelling of 10342414013 in words is "ten billion, three hundred forty-two million, four hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •