Base | Representation |
---|---|
bin | 10011011001010100… |
… | …11100111010101011 |
3 | 222212200220022220222 |
4 | 21230222130322223 |
5 | 132311212034121 |
6 | 4441134440255 |
7 | 516021026420 |
oct | 115452347253 |
9 | 28780808828 |
10 | 10413002411 |
11 | 4463960919 |
12 | 202736308b |
13 | c9c4320b6 |
14 | 70ad4dd47 |
15 | 40e28e0ab |
hex | 26ca9ceab |
10413002411 has 8 divisors (see below), whose sum is σ = 11919439104. Its totient is φ = 8911281960.
The previous prime is 10413002399. The next prime is 10413002417. The reversal of 10413002411 is 11420031401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10413002411 - 222 = 10408808107 is a prime.
It is a super-2 number, since 2×104130024112 (a number of 21 digits) contains 22 as substring.
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 10413002411.
It is not an unprimeable number, because it can be changed into a prime (10413002417) 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, 1174325 + ... + 1183158.
It is an arithmetic number, because the mean of its divisors is an integer number (1489929888).
Almost surely, 210413002411 is an apocalyptic number.
10413002411 is a deficient number, since it is larger than the sum of its proper divisors (1506436693).
10413002411 is an equidigital number, since it uses as much as digits as its factorization.
10413002411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2358121.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10413002411 its reverse (11420031401), we get a palindrome (21833033812).
The spelling of 10413002411 in words is "ten billion, four hundred thirteen million, two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •