Base | Representation |
---|---|
bin | 11001110000111010001111… |
… | …010101101001100000100011 |
3 | 112212012112200021110002021012 |
4 | 121300322033111221200203 |
5 | 104323001422344120003 |
6 | 1040554530515051135 |
7 | 32603352512251232 |
oct | 3160721725514043 |
9 | 485175607402235 |
10 | 113312232020003 |
11 | 331174a1a27905 |
12 | 108608052a0aab |
13 | 4b2c3b3b80303 |
14 | 1dda4ac712b19 |
15 | d177a04178d8 |
hex | 670e8f569823 |
113312232020003 has 8 divisors (see below), whose sum is σ = 113329019082240. Its totient is φ = 113295446222920.
The previous prime is 113312232019969. The next prime is 113312232020021. The reversal of 113312232020003 is 300020232213311.
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 113312232020003 - 230 = 113311158278179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113312232020203) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 186944876 + ... + 187550022.
It is an arithmetic number, because the mean of its divisors is an integer number (14166127385280).
Almost surely, 2113312232020003 is an apocalyptic number.
113312232020003 is a deficient number, since it is larger than the sum of its proper divisors (16787062237).
113312232020003 is a wasteful number, since it uses less digits than its factorization.
113312232020003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632577.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113312232020003 its reverse (300020232213311), we get a palindrome (413332464233314).
The spelling of 113312232020003 in words is "one hundred thirteen trillion, three hundred twelve billion, two hundred thirty-two million, twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •