Base | Representation |
---|---|
bin | 11001000010010101110010… |
… | …110101001100000101110010 |
3 | 112102212121022211011110101202 |
4 | 121002111302311030011302 |
5 | 103413033340244111310 |
6 | 1030104431135131202 |
7 | 32123221041336551 |
oct | 3102256265140562 |
9 | 472777284143352 |
10 | 110112003113330 |
11 | 320a3269163a69 |
12 | 1042453b073b02 |
13 | 495969579580a |
14 | 1d2964118dd98 |
15 | cae3ec5d53a5 |
hex | 642572d4c172 |
110112003113330 has 32 divisors (see below), whose sum is σ = 204629903976960. Its totient is φ = 42616772415360.
The previous prime is 110112003113323. The next prime is 110112003113369. The reversal of 110112003113330 is 33311300211011.
It is a super-2 number, since 2×1101120031133302 (a number of 29 digits) contains 22 as substring.
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, 28288940 + ... + 31945079.
It is an arithmetic number, because the mean of its divisors is an integer number (6394684499280).
Almost surely, 2110112003113330 is an apocalyptic number.
110112003113330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110112003113330 is a deficient number, since it is larger than the sum of its proper divisors (94517900863630).
110112003113330 is a wasteful number, since it uses less digits than its factorization.
110112003113330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60239954.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 110112003113330 its reverse (33311300211011), we get a palindrome (143423303324341).
The spelling of 110112003113330 in words is "one hundred ten trillion, one hundred twelve billion, three million, one hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •