Base | Representation |
---|---|
bin | 110100100111111101… |
… | …1110111011000110000 |
3 | 101210200212201011122000 |
4 | 1221033323313120300 |
5 | 3322421110234440 |
6 | 123525521414000 |
7 | 11110333134315 |
oct | 1511773673060 |
9 | 353625634560 |
10 | 113010243120 |
11 | 43a22377345 |
12 | 19a9aa9a300 |
13 | a870059858 |
14 | 5680cd4d0c |
15 | 2e16511730 |
hex | 1a4fef7630 |
113010243120 has 160 divisors (see below), whose sum is σ = 412155138240. Its totient is φ = 28363345920.
The previous prime is 113010243107. The next prime is 113010243191. The reversal of 113010243120 is 21342010311.
113010243120 is a `hidden beast` number, since 1 + 1 + 301 + 0 + 243 + 120 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 113010243093 and 113010243102.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1502091 + ... + 1575530.
It is an arithmetic number, because the mean of its divisors is an integer number (2575969614).
Almost surely, 2113010243120 is an apocalyptic number.
113010243120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113010243120 is an abundant number, since it is smaller than the sum of its proper divisors (299144895120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113010243120 is a wasteful number, since it uses less digits than its factorization.
113010243120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3077660 (or 3077648 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 113010243120 its reverse (21342010311), we get a palindrome (134352253431).
The spelling of 113010243120 in words is "one hundred thirteen billion, ten million, two hundred forty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.953 sec. • engine limits •