Base | Representation |
---|---|
bin | 1010010111101000100110… |
… | …1011010111111010010111 |
3 | 1111100221100221220011201101 |
4 | 2211322021223113322113 |
5 | 2443244030140133221 |
6 | 40125341205410531 |
7 | 2254464125650021 |
oct | 245721153277227 |
9 | 44327327804641 |
10 | 11401153052311 |
11 | 36a6224741600 |
12 | 1341753109a47 |
13 | 64917c8c9869 |
14 | 2b5b66927011 |
15 | 14b884417d91 |
hex | a5e89ad7e97 |
11401153052311 has 12 divisors (see below), whose sum is σ = 12538269470272. Its totient is φ = 10359371880000.
The previous prime is 11401153052287. The next prime is 11401153052347. The reversal of 11401153052311 is 11325035110411.
It is a happy number.
It is not a de Polignac number, because 11401153052311 - 25 = 11401153052279 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11401153052311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401153052381) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23911650 + ... + 24383791.
Almost surely, 211401153052311 is an apocalyptic number.
11401153052311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11401153052311 is a deficient number, since it is larger than the sum of its proper divisors (1137116417961).
11401153052311 is a wasteful number, since it uses less digits than its factorization.
11401153052311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48297414 (or 48297403 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 11401153052311 its reverse (11325035110411), we get a palindrome (22726188162722).
The spelling of 11401153052311 in words is "eleven trillion, four hundred one billion, one hundred fifty-three million, fifty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •