Base | Representation |
---|---|
bin | 1010010011011111100010… |
… | …1000000001010111011101 |
3 | 1111010010201011212122002022 |
4 | 2210313320220001113131 |
5 | 2441112320000003402 |
6 | 40032532524505525 |
7 | 2246364650666144 |
oct | 244677050012735 |
9 | 44103634778068 |
10 | 11330000000477 |
11 | 367903169a634 |
12 | 132b9b60ab2a5 |
13 | 642550618022 |
14 | 2b2536b2275b |
15 | 149abc9922a2 |
hex | a4df8a015dd |
11330000000477 has 2 divisors, whose sum is σ = 11330000000478. Its totient is φ = 11330000000476.
The previous prime is 11330000000453. The next prime is 11330000000489. The reversal of 11330000000477 is 77400000003311.
11330000000477 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7209794231236 + 4120205769241 = 2685106^2 + 2029829^2 .
It is a cyclic number.
It is not a de Polignac number, because 11330000000477 - 210 = 11329999999453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11330000000447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665000000238 + 5665000000239.
It is an arithmetic number, because the mean of its divisors is an integer number (5665000000239).
Almost surely, 211330000000477 is an apocalyptic number.
It is an amenable number.
11330000000477 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330000000477 is an equidigital number, since it uses as much as digits as its factorization.
11330000000477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1764, while the sum is 26.
Adding to 11330000000477 its reverse (77400000003311), we get a palindrome (88730000003788).
The spelling of 11330000000477 in words is "eleven trillion, three hundred thirty billion, four hundred seventy-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •