Base | Representation |
---|---|
bin | 110100101111000010… |
… | …0000010011010001000 |
3 | 101211022101201012111111 |
4 | 1221132010002122020 |
5 | 3323412300011230 |
6 | 124005225540104 |
7 | 11116241611360 |
oct | 1513604023210 |
9 | 354271635444 |
10 | 113247266440 |
11 | 44034147490 |
12 | 19b46344634 |
13 | a8aa1a7839 |
14 | 56a45939a0 |
15 | 2e2c23092a |
hex | 1a5e102688 |
113247266440 has 64 divisors (see below), whose sum is σ = 317680652160. Its totient is φ = 35297848320.
The previous prime is 113247266401. The next prime is 113247266467. The reversal of 113247266440 is 44662742311.
It is a happy number.
It is a super-2 number, since 2×1132472664402 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 113247266393 and 113247266402.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18381217 + ... + 18387376.
It is an arithmetic number, because the mean of its divisors is an integer number (4963760190).
Almost surely, 2113247266440 is an apocalyptic number.
113247266440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113247266440 is an abundant number, since it is smaller than the sum of its proper divisors (204433385720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113247266440 is a wasteful number, since it uses less digits than its factorization.
113247266440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36768622 (or 36768618 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 40.
The spelling of 113247266440 in words is "one hundred thirteen billion, two hundred forty-seven million, two hundred sixty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •