Base | Representation |
---|---|
bin | 1010010011110011000101… |
… | …0001110001000110110001 |
3 | 1111010122020202002022221121 |
4 | 2210330301101301012301 |
5 | 2441204040312412223 |
6 | 40035201224422241 |
7 | 2246641643313112 |
oct | 244746121610661 |
9 | 44118222068847 |
10 | 11335245435313 |
11 | 36802835a2448 |
12 | 1330a1a917981 |
13 | 642ba827b417 |
14 | 2b28b3632209 |
15 | 149cc822a15d |
hex | a4f314711b1 |
11335245435313 has 2 divisors, whose sum is σ = 11335245435314. Its totient is φ = 11335245435312.
The previous prime is 11335245435307. The next prime is 11335245435347. The reversal of 11335245435313 is 31353454253311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6524693705104 + 4810551730209 = 2554348^2 + 2193297^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11335245435313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11335245435313.
It is not a weakly prime, because it can be changed into another prime (11335245435373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5667622717656 + 5667622717657.
It is an arithmetic number, because the mean of its divisors is an integer number (5667622717657).
Almost surely, 211335245435313 is an apocalyptic number.
It is an amenable number.
11335245435313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11335245435313 is an equidigital number, since it uses as much as digits as its factorization.
11335245435313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972000, while the sum is 43.
Adding to 11335245435313 its reverse (31353454253311), we get a palindrome (42688699688624).
The spelling of 11335245435313 in words is "eleven trillion, three hundred thirty-five billion, two hundred forty-five million, four hundred thirty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •