Base | Representation |
---|---|
bin | 10100011000111000110… |
… | …000010111000110010001 |
3 | 11221221111212112212212012 |
4 | 110120320300113012101 |
5 | 140423434023240423 |
6 | 2551354534512305 |
7 | 203140564405535 |
oct | 24307060270621 |
9 | 4857455485765 |
10 | 1401111540113 |
11 | 4a0231a3488a |
12 | 1a7665505695 |
13 | a217cc9840c |
14 | 4bb580adbc5 |
15 | 266a5a25078 |
hex | 14638c17191 |
1401111540113 has 12 divisors (see below), whose sum is σ = 1510592620752. Its totient is φ = 1299011208000.
The previous prime is 1401111540071. The next prime is 1401111540119. The reversal of 1401111540113 is 3110451111041.
It is not a de Polignac number, because 1401111540113 - 210 = 1401111539089 is a prime.
It is a super-2 number, since 2×14011115401132 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1401111540119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36160763 + ... + 36199488.
It is an arithmetic number, because the mean of its divisors is an integer number (125882718396).
Almost surely, 21401111540113 is an apocalyptic number.
It is an amenable number.
1401111540113 is a deficient number, since it is larger than the sum of its proper divisors (109481080639).
1401111540113 is an equidigital number, since it uses as much as digits as its factorization.
1401111540113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72360352 (or 72360335 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 23.
Adding to 1401111540113 its reverse (3110451111041), we get a palindrome (4511562651154).
The spelling of 1401111540113 in words is "one trillion, four hundred one billion, one hundred eleven million, five hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •