Base | Representation |
---|---|
bin | 1010000010111110101110… |
… | …1010000110101000110101 |
3 | 1110010000110122202011221111 |
4 | 2200233223222012220311 |
5 | 2421440323014213023 |
6 | 35254335030115021 |
7 | 2220032654613526 |
oct | 240575352065065 |
9 | 43100418664844 |
10 | 11046314601013 |
11 | 357979668517a |
12 | 12a4a244aba71 |
13 | 6218807b3003 |
14 | 2a290464684d |
15 | 14251771e00d |
hex | a0beba86a35 |
11046314601013 has 2 divisors, whose sum is σ = 11046314601014. Its totient is φ = 11046314601012.
The previous prime is 11046314600999. The next prime is 11046314601029. The reversal of 11046314601013 is 31010641364011.
11046314601013 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., 9327850547409 + 1718464053604 = 3054153^2 + 1310902^2 .
It is a cyclic number.
It is not a de Polignac number, because 11046314601013 - 29 = 11046314600501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11046314601083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5523157300506 + 5523157300507.
It is an arithmetic number, because the mean of its divisors is an integer number (5523157300507).
Almost surely, 211046314601013 is an apocalyptic number.
It is an amenable number.
11046314601013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11046314601013 is an equidigital number, since it uses as much as digits as its factorization.
11046314601013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 11046314601013 its reverse (31010641364011), we get a palindrome (42056955965024).
The spelling of 11046314601013 in words is "eleven trillion, forty-six billion, three hundred fourteen million, six hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •