Base | Representation |
---|---|
bin | 11001110010011000000101… |
… | …101010010111111000010001 |
3 | 112212120011210001211121001222 |
4 | 121302120011222113320101 |
5 | 104331124311330141423 |
6 | 1041113114044534425 |
7 | 32613550621043354 |
oct | 3162300552277021 |
9 | 485504701747058 |
10 | 113413001412113 |
11 | 33156202698657 |
12 | 10878248851415 |
13 | 4b38a52bb7050 |
14 | 200130ba1229b |
15 | d1a1ebe803c8 |
hex | 672605a97e11 |
113413001412113 has 16 divisors (see below), whose sum is σ = 122596052705280. Its totient is φ = 104295549198144.
The previous prime is 113413001412049. The next prime is 113413001412119. The reversal of 113413001412113 is 311214100314311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 113413001412113 - 26 = 113413001412049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113413001412119) 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, 87984620 + ... + 89264322.
It is an arithmetic number, because the mean of its divisors is an integer number (7662253294080).
Almost surely, 2113413001412113 is an apocalyptic number.
113413001412113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113413001412113 is a deficient number, since it is larger than the sum of its proper divisors (9183051293167).
113413001412113 is a wasteful number, since it uses less digits than its factorization.
113413001412113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1305328.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 113413001412113 its reverse (311214100314311), we get a palindrome (424627101726424).
The spelling of 113413001412113 in words is "one hundred thirteen trillion, four hundred thirteen billion, one million, four hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •