Base | Representation |
---|---|
bin | 11001110100001110101111… |
… | …010011001001111101100111 |
3 | 112220000100121210120211101112 |
4 | 121310032233103021331213 |
5 | 104340221220241112403 |
6 | 1041251423531015235 |
7 | 32626010665002110 |
oct | 3164165723117547 |
9 | 486010553524345 |
10 | 113540401504103 |
11 | 331a5239725382 |
12 | 10898a8289a51b |
13 | 4b47a7724b772 |
14 | 2007555aa1207 |
15 | d1d6a69309d8 |
hex | 6743af4c9f67 |
113540401504103 has 16 divisors (see below), whose sum is σ = 129789665501184. Its totient is φ = 97298440563840.
The previous prime is 113540401504051. The next prime is 113540401504121. The reversal of 113540401504103 is 301405104045311.
It is a cyclic number.
It is not a de Polignac number, because 113540401504103 - 212 = 113540401500007 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 113540401504103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113540401504183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1875833426 + ... + 1875893952.
It is an arithmetic number, because the mean of its divisors is an integer number (8111854093824).
Almost surely, 2113540401504103 is an apocalyptic number.
113540401504103 is a deficient number, since it is larger than the sum of its proper divisors (16249263997081).
113540401504103 is an equidigital number, since it uses as much as digits as its factorization.
113540401504103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116422.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 113540401504103 its reverse (301405104045311), we get a palindrome (414945505549414).
The spelling of 113540401504103 in words is "one hundred thirteen trillion, five hundred forty billion, four hundred one million, five hundred four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •