Base | Representation |
---|---|
bin | 11001110100001111010011… |
… | …000101111110110010100101 |
3 | 112220000102011122120201101111 |
4 | 121310033103011332302211 |
5 | 104340223433004431440 |
6 | 1041252003302225021 |
7 | 32626031606252146 |
oct | 3164172305766245 |
9 | 486012148521344 |
10 | 113541002030245 |
11 | 331a5517702579 |
12 | 1089900ba25171 |
13 | 4b47b4179c98a |
14 | 20075b1743acd |
15 | d1d6de5044ea |
hex | 6743d317eca5 |
113541002030245 has 8 divisors (see below), whose sum is σ = 139572353715480. Its totient is φ = 88617367438080.
The previous prime is 113541002030237. The next prime is 113541002030333. The reversal of 113541002030245 is 542030200145311.
It can be written as a sum of positive squares in 4 ways, for example, as 8197238538724 + 105343763491521 = 2863082^2 + 10263711^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113541002030245 - 23 = 113541002030237 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 276929273040 + ... + 276929273449.
It is an arithmetic number, because the mean of its divisors is an integer number (17446544214435).
Almost surely, 2113541002030245 is an apocalyptic number.
It is an amenable number.
113541002030245 is a deficient number, since it is larger than the sum of its proper divisors (26031351685235).
113541002030245 is an equidigital number, since it uses as much as digits as its factorization.
113541002030245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 553858546535.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 113541002030245 its reverse (542030200145311), we get a palindrome (655571202175556).
The spelling of 113541002030245 in words is "one hundred thirteen trillion, five hundred forty-one billion, two million, thirty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •