Base | Representation |
---|---|
bin | 11001110100011010000000… |
… | …100100111010010101010101 |
3 | 112220001111212010210201011012 |
4 | 121310122000210322111111 |
5 | 104340421011122001123 |
6 | 1041301144410022005 |
7 | 32626616604020111 |
oct | 3164320044722525 |
9 | 486044763721135 |
10 | 113552502531413 |
11 | 331aa38940a2a0 |
12 | 1089b29b417905 |
13 | 4b48c552c655a |
14 | 2007d82c9a741 |
15 | d1db63eaa378 |
hex | 67468093a555 |
113552502531413 has 16 divisors (see below), whose sum is σ = 124851323013120. Its totient is φ = 102416708300400.
The previous prime is 113552502531341. The next prime is 113552502531427. The reversal of 113552502531413 is 314135205255311.
It is a cyclic number.
It is not a de Polignac number, because 113552502531413 - 238 = 113277624624469 is a prime.
It is a super-2 number, since 2×1135525025314132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113552502531613) 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, 3600023 + ... + 15494036.
It is an arithmetic number, because the mean of its divisors is an integer number (7803207688320).
Almost surely, 2113552502531413 is an apocalyptic number.
It is an amenable number.
113552502531413 is a deficient number, since it is larger than the sum of its proper divisors (11298820481707).
113552502531413 is a wasteful number, since it uses less digits than its factorization.
113552502531413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19098328.
The product of its (nonzero) digits is 270000, while the sum is 41.
Adding to 113552502531413 its reverse (314135205255311), we get a palindrome (427687707786724).
The spelling of 113552502531413 in words is "one hundred thirteen trillion, five hundred fifty-two billion, five hundred two million, five hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •