Base | Representation |
---|---|
bin | 110100110011110010… |
… | …0011000011110001000 |
3 | 101211201111210022120222 |
4 | 1221213210120132020 |
5 | 3324224111142420 |
6 | 124033124005212 |
7 | 11123216250044 |
oct | 1514744303610 |
9 | 354644708528 |
10 | 113406740360 |
11 | 4410616a611 |
12 | 19b8b830808 |
13 | a9042429c4 |
14 | 56bb827024 |
15 | 2e3b232225 |
hex | 1a67918788 |
113406740360 has 64 divisors (see below), whose sum is σ = 255718954800. Its totient is φ = 45264384000.
The previous prime is 113406740353. The next prime is 113406740413. The reversal of 113406740360 is 63047604311.
It can be written as a sum of positive squares in 8 ways, for example, as 24004544356 + 89402196004 = 154934^2 + 299002^2 .
It is a super-2 number, since 2×1134067403602 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113406740360.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59655410 + ... + 59657310.
Almost surely, 2113406740360 is an apocalyptic number.
113406740360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113406740360 is an abundant number, since it is smaller than the sum of its proper divisors (142312214440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113406740360 is a wasteful number, since it uses less digits than its factorization.
113406740360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4362 (or 4358 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 35.
The spelling of 113406740360 in words is "one hundred thirteen billion, four hundred six million, seven hundred forty thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •