Base | Representation |
---|---|
bin | 11001101111110010111001… |
… | …101000010100001010001010 |
3 | 112211221012221220021020221221 |
4 | 121233302321220110022022 |
5 | 104320223033312120114 |
6 | 1040455421541552254 |
7 | 32565001345124500 |
oct | 3157627150241212 |
9 | 484835856236857 |
10 | 113235632145034 |
11 | 33097a64332013 |
12 | 108499a811568a |
13 | 4b250c72b61c9 |
14 | 1dd68c3378670 |
15 | d157ba6c8524 |
hex | 66fcb9a1428a |
113235632145034 has 24 divisors (see below), whose sum is σ = 197729162532000. Its totient is φ = 48494055803256.
The previous prime is 113235632145019. The next prime is 113235632145067. The reversal of 113235632145034 is 430541236532311.
It is a super-2 number, since 2×1132356321450342 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 422494284 + ... + 422762215.
It is an arithmetic number, because the mean of its divisors is an integer number (8238715105500).
Almost surely, 2113235632145034 is an apocalyptic number.
113235632145034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
113235632145034 is a deficient number, since it is larger than the sum of its proper divisors (84493530386966).
113235632145034 is a wasteful number, since it uses less digits than its factorization.
113235632145034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845257882 (or 845257875 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 43.
Adding to 113235632145034 its reverse (430541236532311), we get a palindrome (543776868677345).
The spelling of 113235632145034 in words is "one hundred thirteen trillion, two hundred thirty-five billion, six hundred thirty-two million, one hundred forty-five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •