Base | Representation |
---|---|
bin | 10100100011000010… |
… | …11110101110001101 |
3 | 1001110210112120020012 |
4 | 22101201132232031 |
5 | 140043020020001 |
6 | 5022345203005 |
7 | 540240262622 |
oct | 122141365615 |
9 | 31423476205 |
10 | 11031407501 |
11 | 4750a3a804 |
12 | 217a490465 |
13 | 106a5a317a |
14 | 769128349 |
15 | 4486e52bb |
hex | 29185eb8d |
11031407501 has 2 divisors, whose sum is σ = 11031407502. Its totient is φ = 11031407500.
The previous prime is 11031407473. The next prime is 11031407573. The reversal of 11031407501 is 10570413011.
It is a happy number.
11031407501 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., 10893931876 + 137475625 = 104374^2 + 11725^2 .
It is an emirp because it is prime and its reverse (10570413011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11031407501 - 214 = 11031391117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031407801) 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, 5515703750 + 5515703751.
It is an arithmetic number, because the mean of its divisors is an integer number (5515703751).
Almost surely, 211031407501 is an apocalyptic number.
It is an amenable number.
11031407501 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031407501 is an equidigital number, since it uses as much as digits as its factorization.
11031407501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 23.
The spelling of 11031407501 in words is "eleven billion, thirty-one million, four hundred seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •