Base | Representation |
---|---|
bin | 110100110000101111… |
… | …0000111010111001001 |
3 | 101211110101021121211000 |
4 | 1221201132013113021 |
5 | 3324021413342441 |
6 | 124015031125213 |
7 | 11120534541114 |
oct | 1514136072711 |
9 | 354411247730 |
10 | 113304434121 |
11 | 440634433aa |
12 | 19b61513809 |
13 | a8b8ca2578 |
14 | 56abdd557b |
15 | 2e322742b6 |
hex | 1a617875c9 |
113304434121 has 16 divisors (see below), whose sum is σ = 177732446400. Its totient is φ = 71092977984.
The previous prime is 113304434093. The next prime is 113304434123. The reversal of 113304434121 is 121434403311.
113304434121 is a `hidden beast` number, since 1 + 13 + 304 + 4 + 341 + 2 + 1 = 666.
It is not a de Polignac number, because 113304434121 - 29 = 113304433609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (113304434123) 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 15 ways as a sum of consecutive naturals, for example, 123424851 + ... + 123425768.
It is an arithmetic number, because the mean of its divisors is an integer number (11108277900).
Almost surely, 2113304434121 is an apocalyptic number.
It is an amenable number.
113304434121 is a deficient number, since it is larger than the sum of its proper divisors (64428012279).
113304434121 is a wasteful number, since it uses less digits than its factorization.
113304434121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246850645 (or 246850639 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 113304434121 its reverse (121434403311), we get a palindrome (234738837432).
The spelling of 113304434121 in words is "one hundred thirteen billion, three hundred four million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •