Base | Representation |
---|---|
bin | 110100110011101010… |
… | …0000100011111001101 |
3 | 101211201012202001210212 |
4 | 1221213110010133031 |
5 | 3324222012323310 |
6 | 124032452212205 |
7 | 11123135020112 |
oct | 1514724043715 |
9 | 354635661725 |
10 | 113402464205 |
11 | 441038098a8 |
12 | 19b8a30a065 |
13 | a9033a6534 |
14 | 56bb032909 |
15 | 2e3ab8a205 |
hex | 1a675047cd |
113402464205 has 8 divisors (see below), whose sum is σ = 139760875032. Its totient is φ = 88270026048.
The previous prime is 113402464177. The next prime is 113402464271. The reversal of 113402464205 is 502464204311.
It can be written as a sum of positive squares in 4 ways, for example, as 8697800644 + 104704663561 = 93262^2 + 323581^2 .
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 113402464205 - 26 = 113402464141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 306492962 + ... + 306493331.
It is an arithmetic number, because the mean of its divisors is an integer number (17470109379).
Almost surely, 2113402464205 is an apocalyptic number.
It is an amenable number.
113402464205 is a deficient number, since it is larger than the sum of its proper divisors (26358410827).
113402464205 is an equidigital number, since it uses as much as digits as its factorization.
113402464205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612986335.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 113402464205 its reverse (502464204311), we get a palindrome (615866668516).
The spelling of 113402464205 in words is "one hundred thirteen billion, four hundred two million, four hundred sixty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •