Base | Representation |
---|---|
bin | 110100101101110001… |
… | …0111101101001000010 |
3 | 101211012110020222002100 |
4 | 1221123202331221002 |
5 | 3323320442313410 |
6 | 124001120531230 |
7 | 11115216656304 |
oct | 1513342755102 |
9 | 354173228070 |
10 | 113205041730 |
11 | 44012327430 |
12 | 19b34180b16 |
13 | a8a15124c1 |
14 | 569cb21974 |
15 | 2e2868e8c0 |
hex | 1a5b8bda42 |
113205041730 has 48 divisors (see below), whose sum is σ = 321090666624. Its totient is φ = 27443646240.
The previous prime is 113205041707. The next prime is 113205041731. The reversal of 113205041730 is 37140502311.
113205041730 is a `hidden beast` number, since 1 + 13 + 205 + 0 + 417 + 30 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 113205041694 and 113205041703.
It is not an unprimeable number, because it can be changed into a prime (113205041731) 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 23 ways as a sum of consecutive naturals, for example, 57173274 + ... + 57175253.
It is an arithmetic number, because the mean of its divisors is an integer number (6689388888).
Almost surely, 2113205041730 is an apocalyptic number.
113205041730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113205041730 is an abundant number, since it is smaller than the sum of its proper divisors (207885624894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113205041730 is a wasteful number, since it uses less digits than its factorization.
113205041730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114348551 (or 114348548 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The spelling of 113205041730 in words is "one hundred thirteen billion, two hundred five million, forty-one thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •