Base | Representation |
---|---|
bin | 10100100011000010… |
… | …11101011101100101 |
3 | 1001110210112022011002 |
4 | 22101201131131211 |
5 | 140043014333331 |
6 | 5022345123045 |
7 | 540240241601 |
oct | 122141353545 |
9 | 31423468132 |
10 | 11031402341 |
11 | 4750a36943 |
12 | 217a489485 |
13 | 106a5a0a0b |
14 | 769126501 |
15 | 4486e39cb |
hex | 29185d765 |
11031402341 has 2 divisors, whose sum is σ = 11031402342. Its totient is φ = 11031402340.
The previous prime is 11031402329. The next prime is 11031402377. The reversal of 11031402341 is 14320413011.
11031402341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8584022500 + 2447379841 = 92650^2 + 49471^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11031402341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031432341) 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 as a sum of consecutive naturals, namely, 5515701170 + 5515701171.
It is an arithmetic number, because the mean of its divisors is an integer number (5515701171).
Almost surely, 211031402341 is an apocalyptic number.
It is an amenable number.
11031402341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031402341 is an equidigital number, since it uses as much as digits as its factorization.
11031402341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11031402341 its reverse (14320413011), we get a palindrome (25351815352).
The spelling of 11031402341 in words is "eleven billion, thirty-one million, four hundred two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •