Base | Representation |
---|---|
bin | 11001110000110011101111… |
… | …011111011001101111110101 |
3 | 112212011212200001102200221110 |
4 | 121300303233133121233311 |
5 | 104322343130321130104 |
6 | 1040551414330505233 |
7 | 32603014564603455 |
oct | 3160635737315765 |
9 | 485155601380843 |
10 | 113305255255029 |
11 | 33114541803042 |
12 | 1085b398895219 |
13 | 4b2b841621106 |
14 | 1dda009cc3d65 |
15 | d174e2b8ce89 |
hex | 670cef7d9bf5 |
113305255255029 has 8 divisors (see below), whose sum is σ = 151410140654400. Its totient is φ = 75368603346176.
The previous prime is 113305255254953. The next prime is 113305255255043. The reversal of 113305255255029 is 920552552503311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113305255255029 - 29 = 113305255254517 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113305255255429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42058371057 + ... + 42058373750.
It is an arithmetic number, because the mean of its divisors is an integer number (18926267581800).
Almost surely, 2113305255255029 is an apocalyptic number.
It is an amenable number.
113305255255029 is a deficient number, since it is larger than the sum of its proper divisors (38104885399371).
113305255255029 is an equidigital number, since it uses as much as digits as its factorization.
113305255255029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84116745259.
The product of its (nonzero) digits is 2025000, while the sum is 48.
The spelling of 113305255255029 in words is "one hundred thirteen trillion, three hundred five billion, two hundred fifty-five million, two hundred fifty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •