Base | Representation |
---|---|
bin | 11001110100001110011110… |
… | …001010111000001010111101 |
3 | 112220000022212202211021102220 |
4 | 121310032132022320022331 |
5 | 104340220123203341110 |
6 | 1041251335223235553 |
7 | 32626000605202506 |
oct | 3164163612701275 |
9 | 486008782737386 |
10 | 113540114121405 |
11 | 331a5101489514 |
12 | 10898a025a8bb9 |
13 | 4b47a2c84a92a |
14 | 2007529853bad |
15 | d1d68b5b5370 |
hex | 67439e2b82bd |
113540114121405 has 16 divisors (see below), whose sum is σ = 181673902382784. Its totient is φ = 60551487601920.
The previous prime is 113540114121397. The next prime is 113540114121409. The reversal of 113540114121405 is 504121411045311.
It is not a de Polignac number, because 113540114121405 - 23 = 113540114121397 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113540114121409) 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, 202205884 + ... + 202766613.
It is an arithmetic number, because the mean of its divisors is an integer number (11354618898924).
Almost surely, 2113540114121405 is an apocalyptic number.
113540114121405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
113540114121405 is a deficient number, since it is larger than the sum of its proper divisors (68133788261379).
113540114121405 is a wasteful number, since it uses less digits than its factorization.
113540114121405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404991196.
The product of its (nonzero) digits is 9600, while the sum is 33.
Adding to 113540114121405 its reverse (504121411045311), we get a palindrome (617661525166716).
The spelling of 113540114121405 in words is "one hundred thirteen trillion, five hundred forty billion, one hundred fourteen million, one hundred twenty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •