Base | Representation |
---|---|
bin | 10101001111001001… |
… | …11100010111100001 |
3 | 1002102120202211212210 |
4 | 22213210330113201 |
5 | 141322230222423 |
6 | 5123203512333 |
7 | 552352264245 |
oct | 124744742741 |
9 | 32376684783 |
10 | 11401414113 |
11 | 492088a1a1 |
12 | 22623886a9 |
13 | 10c91427ab |
14 | 7a2322425 |
15 | 46ae31b93 |
hex | 2a793c5e1 |
11401414113 has 64 divisors (see below), whose sum is σ = 16945459200. Its totient is φ = 6792514560.
The previous prime is 11401414069. The next prime is 11401414127. The reversal of 11401414113 is 31141410411.
It is not a de Polignac number, because 11401414113 - 28 = 11401413857 is a prime.
It is a super-2 number, since 2×114014141132 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11401414113.
It is not an unprimeable number, because it can be changed into a prime (11401414133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8376553 + ... + 8377913.
It is an arithmetic number, because the mean of its divisors is an integer number (264772800).
Almost surely, 211401414113 is an apocalyptic number.
It is an amenable number.
11401414113 is a deficient number, since it is larger than the sum of its proper divisors (5544045087).
11401414113 is a wasteful number, since it uses less digits than its factorization.
11401414113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1542.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 11401414113 its reverse (31141410411), we get a palindrome (42542824524).
The spelling of 11401414113 in words is "eleven billion, four hundred one million, four hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •