Base | Representation |
---|---|
bin | 11001110100010000011011… |
… | …101101001000101111000001 |
3 | 112220000112022112212220102012 |
4 | 121310100123231020233001 |
5 | 104340233431341113040 |
6 | 1041252324221102305 |
7 | 32626104031061264 |
oct | 3164203355105701 |
9 | 486015275786365 |
10 | 113542220254145 |
11 | 331a5a92326191 |
12 | 108992ab9b7995 |
13 | 4b47ca6ca5017 |
14 | 2007689458cdb |
15 | d1d76143e865 |
hex | 67441bb48bc1 |
113542220254145 has 4 divisors (see below), whose sum is σ = 136250664304980. Its totient is φ = 90833776203312.
The previous prime is 113542220254123. The next prime is 113542220254189. The reversal of 113542220254145 is 541452022245311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 67264799086144 + 46277421168001 = 8201512^2 + 6802751^2 .
It is a cyclic number.
It is not a de Polignac number, because 113542220254145 - 212 = 113542220250049 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11354222025410 + ... + 11354222025419.
It is an arithmetic number, because the mean of its divisors is an integer number (34062666076245).
Almost surely, 2113542220254145 is an apocalyptic number.
It is an amenable number.
113542220254145 is a deficient number, since it is larger than the sum of its proper divisors (22708444050835).
113542220254145 is an equidigital number, since it uses as much as digits as its factorization.
113542220254145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22708444050834.
The product of its (nonzero) digits is 384000, while the sum is 41.
Adding to 113542220254145 its reverse (541452022245311), we get a palindrome (654994242499456).
The spelling of 113542220254145 in words is "one hundred thirteen trillion, five hundred forty-two billion, two hundred twenty million, two hundred fifty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •