Base | Representation |
---|---|
bin | 1001011110001000111100… |
… | …0100011001101001010011 |
3 | 1100212111210211012000200201 |
4 | 2113202033010121221103 |
5 | 2331103121130133021 |
6 | 34051503403400031 |
7 | 2123225533136362 |
oct | 227421704315123 |
9 | 40774724160621 |
10 | 10413401021011 |
11 | 335533144389a |
12 | 120222ab23017 |
13 | 5a6c96c767a1 |
14 | 2800230097d9 |
15 | 130d230a4591 |
hex | 9788f119a53 |
10413401021011 has 4 divisors (see below), whose sum is σ = 10413411223072. Its totient is φ = 10413390818952.
The previous prime is 10413401021003. The next prime is 10413401021021. The reversal of 10413401021011 is 11012010431401.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10413401021011 - 23 = 10413401021003 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 10413401021011.
It is not an unprimeable number, because it can be changed into a prime (10413401021021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3375360 + ... + 5676253.
It is an arithmetic number, because the mean of its divisors is an integer number (2603352805768).
Almost surely, 210413401021011 is an apocalyptic number.
10413401021011 is a deficient number, since it is larger than the sum of its proper divisors (10202061).
10413401021011 is an equidigital number, since it uses as much as digits as its factorization.
10413401021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10202060.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10413401021011 its reverse (11012010431401), we get a palindrome (21425411452412).
The spelling of 10413401021011 in words is "ten trillion, four hundred thirteen billion, four hundred one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •