Base | Representation |
---|---|
bin | 11001110000110010100110… |
… | …000011000110110010000001 |
3 | 112212011202111011220202202012 |
4 | 121300302212003012302001 |
5 | 104322333114403204140 |
6 | 1040551052153302305 |
7 | 32602642213504364 |
oct | 3160624603066201 |
9 | 485152434822665 |
10 | 113304023100545 |
11 | 33113a6a235152 |
12 | 1085b0b4104995 |
13 | 4b2b6a627c114 |
14 | 1dd9d303c40db |
15 | d1746e900265 |
hex | 670ca60c6c81 |
113304023100545 has 8 divisors (see below), whose sum is σ = 135964901002560. Its totient is φ = 90643169625840.
The previous prime is 113304023100539. The next prime is 113304023100547. The reversal of 113304023100545 is 545001320403311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113304023100545 - 26 = 113304023100481 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113304023100547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6441860 + ... + 16373930.
It is an arithmetic number, because the mean of its divisors is an integer number (16995612625320).
Almost surely, 2113304023100545 is an apocalyptic number.
It is an amenable number.
113304023100545 is a deficient number, since it is larger than the sum of its proper divisors (22660877902015).
113304023100545 is an equidigital number, since it uses as much as digits as its factorization.
113304023100545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12213655.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 113304023100545 its reverse (545001320403311), we get a palindrome (658305343503856).
The spelling of 113304023100545 in words is "one hundred thirteen trillion, three hundred four billion, twenty-three million, one hundred thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •