Base | Representation |
---|---|
bin | 1010001011111111110101… |
… | …0110101011000110100101 |
3 | 1110122211100000000002121121 |
4 | 2202333331112223012211 |
5 | 2432010104430220122 |
6 | 35453435115413541 |
7 | 2234155633526242 |
oct | 242777526530645 |
9 | 43584300002547 |
10 | 11201230320037 |
11 | 362946255582a |
12 | 130aa594542b1 |
13 | 63336b5c2244 |
14 | 2aa1dcbda5c9 |
15 | 146582b57bc7 |
hex | a2ffd5ab1a5 |
11201230320037 has 2 divisors, whose sum is σ = 11201230320038. Its totient is φ = 11201230320036.
The previous prime is 11201230319969. The next prime is 11201230320053. The reversal of 11201230320037 is 73002303210211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9271592615041 + 1929637704996 = 3044929^2 + 1389114^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201230320037 - 211 = 11201230317989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201230319993 and 11201230320020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201230320067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600615160018 + 5600615160019.
It is an arithmetic number, because the mean of its divisors is an integer number (5600615160019).
Almost surely, 211201230320037 is an apocalyptic number.
It is an amenable number.
11201230320037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201230320037 is an equidigital number, since it uses as much as digits as its factorization.
11201230320037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 11201230320037 its reverse (73002303210211), we get a palindrome (84203533530248).
The spelling of 11201230320037 in words is "eleven trillion, two hundred one billion, two hundred thirty million, three hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •