Base | Representation |
---|---|
bin | 110100001001111101… |
… | …0011011010011111100 |
3 | 101201002200211202110122 |
4 | 1220103322123103330 |
5 | 3313340311424040 |
6 | 123241545554112 |
7 | 11043354525650 |
oct | 1502372332374 |
9 | 351080752418 |
10 | 112003233020 |
11 | 435559a5798 |
12 | 198597a5938 |
13 | a73c5369a3 |
14 | 55c7280a60 |
15 | 2da7de81b5 |
hex | 1a13e9b4fc |
112003233020 has 48 divisors (see below), whose sum is σ = 269878791168. Its totient is φ = 38248104000.
The previous prime is 112003232983. The next prime is 112003233031. The reversal of 112003233020 is 20332300211.
112003233020 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 112003233020.
It is a congruent number.
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, 1558532 + ... + 1628811.
It is an arithmetic number, because the mean of its divisors is an integer number (5622474816).
Almost surely, 2112003233020 is an apocalyptic number.
112003233020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112003233020 is an abundant number, since it is smaller than the sum of its proper divisors (157875558148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112003233020 is a wasteful number, since it uses less digits than its factorization.
112003233020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3187610 (or 3187608 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 112003233020 its reverse (20332300211), we get a palindrome (132335533231).
The spelling of 112003233020 in words is "one hundred twelve billion, three million, two hundred thirty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •