Base | Representation |
---|---|
bin | 110100101111010011… |
… | …1010011011010100100 |
3 | 101211100001002212211210 |
4 | 1221132213103122210 |
5 | 3323422131324030 |
6 | 124010200031420 |
7 | 11116413314013 |
oct | 1513647233244 |
9 | 354301085753 |
10 | 113256511140 |
11 | 44039391133 |
12 | 19b49462570 |
13 | a8ac093686 |
14 | 56a58bca7a |
15 | 2e2ce59bb0 |
hex | 1a5e9d36a4 |
113256511140 has 24 divisors (see below), whose sum is σ = 317118231360. Its totient is φ = 30201736288.
The previous prime is 113256511139. The next prime is 113256511201. The reversal of 113256511140 is 41115652311.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 113256511098 and 113256511107.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 943804200 + ... + 943804319.
It is an arithmetic number, because the mean of its divisors is an integer number (13213259640).
Almost surely, 2113256511140 is an apocalyptic number.
113256511140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113256511140 is an abundant number, since it is smaller than the sum of its proper divisors (203861720220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113256511140 is a wasteful number, since it uses less digits than its factorization.
113256511140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1887608531 (or 1887608529 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 113256511140 in words is "one hundred thirteen billion, two hundred fifty-six million, five hundred eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •