Base | Representation |
---|---|
bin | 11001101101111111110000… |
… | …010011111010111101110010 |
3 | 112211111101211110002122110000 |
4 | 121231333300103322331302 |
5 | 104311211331321304013 |
6 | 1040322533335250430 |
7 | 32553033460001625 |
oct | 3155776023727562 |
9 | 484441743078400 |
10 | 113111995494258 |
11 | 3304a5896a6392 |
12 | 10829a42519a16 |
13 | 4b16552858797 |
14 | 1dd0915061dbc |
15 | d12481321973 |
hex | 66dff04faf72 |
113111995494258 has 40 divisors (see below), whose sum is σ = 253455727068720. Its totient is φ = 37703839250520.
The previous prime is 113111995494233. The next prime is 113111995494299. The reversal of 113111995494258 is 852494599111311.
113111995494258 is a `hidden beast` number, since 1 + 1 + 3 + 1 + 1 + 1 + 9 + 95 + 494 + 2 + 58 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 113111995494195 and 113111995494204.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 40713573 + ... + 43402983.
It is an arithmetic number, because the mean of its divisors is an integer number (6336393176718).
Almost surely, 2113111995494258 is an apocalyptic number.
113111995494258 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
113111995494258 is an abundant number, since it is smaller than the sum of its proper divisors (140343731574462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113111995494258 is a wasteful number, since it uses less digits than its factorization.
113111995494258 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2949044 (or 2949035 counting only the distinct ones).
The product of its digits is 13996800, while the sum is 63.
The spelling of 113111995494258 in words is "one hundred thirteen trillion, one hundred eleven billion, nine hundred ninety-five million, four hundred ninety-four thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •