Base | Representation |
---|---|
bin | 10100100000011111… |
… | …10110110101101101 |
3 | 1001102022021111000211 |
4 | 22100033312311231 |
5 | 140022030313402 |
6 | 5020302422421 |
7 | 536560354624 |
oct | 122017666555 |
9 | 31368244024 |
10 | 11010010477 |
11 | 473a955914 |
12 | 2173291a11 |
13 | 1066020bcb |
14 | 7663586bb |
15 | 4468ba4d7 |
hex | 2903f6d6d |
11010010477 has 2 divisors, whose sum is σ = 11010010478. Its totient is φ = 11010010476.
The previous prime is 11010010463. The next prime is 11010010519. The reversal of 11010010477 is 77401001011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6672602596 + 4337407881 = 81686^2 + 65859^2 .
It is an emirp because it is prime and its reverse (77401001011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010010477 is a prime.
It is a super-3 number, since 3×110100104773 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010010177) 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 as a sum of consecutive naturals, namely, 5505005238 + 5505005239.
It is an arithmetic number, because the mean of its divisors is an integer number (5505005239).
Almost surely, 211010010477 is an apocalyptic number.
It is an amenable number.
11010010477 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010010477 is an equidigital number, since it uses as much as digits as its factorization.
11010010477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196, while the sum is 22.
Adding to 11010010477 its reverse (77401001011), we get a palindrome (88411011488).
The spelling of 11010010477 in words is "eleven billion, ten million, ten thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •