Base | Representation |
---|---|
bin | 1010000000110111111011… |
… | …1110100010100101001001 |
3 | 1102222120001222212101020022 |
4 | 2200031332332202211021 |
5 | 2420342222131102213 |
6 | 35225552400510225 |
7 | 2214312215430236 |
oct | 240157676424511 |
9 | 42876058771208 |
10 | 11010131503433 |
11 | 3565409222447 |
12 | 1299a0691b375 |
13 | 61b3354353ba |
14 | 2a0c70d6a78d |
15 | 1415ead91308 |
hex | a037efa2949 |
11010131503433 has 2 divisors, whose sum is σ = 11010131503434. Its totient is φ = 11010131503432.
The previous prime is 11010131503429. The next prime is 11010131503499. The reversal of 11010131503433 is 33430513101011.
It is a happy number.
11010131503433 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., 10967840403529 + 42291099904 = 3311773^2 + 205648^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010131503433 - 22 = 11010131503429 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010131503633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505065751716 + 5505065751717.
It is an arithmetic number, because the mean of its divisors is an integer number (5505065751717).
Almost surely, 211010131503433 is an apocalyptic number.
It is an amenable number.
11010131503433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010131503433 is an equidigital number, since it uses as much as digits as its factorization.
11010131503433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 11010131503433 its reverse (33430513101011), we get a palindrome (44440644604444).
The spelling of 11010131503433 in words is "eleven trillion, ten billion, one hundred thirty-one million, five hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •