Base | Representation |
---|---|
bin | 110100110001100000… |
… | …0000110101001100000 |
3 | 101211112011121200000110 |
4 | 1221203000012221200 |
5 | 3324100002340222 |
6 | 124021345451320 |
7 | 11121266064642 |
oct | 1514300065140 |
9 | 354464550013 |
10 | 113330121312 |
11 | 44076998591 |
12 | 19b6a040b40 |
13 | a8c13c74a5 |
14 | 56b15a0892 |
15 | 2e3464a30c |
hex | 1a63006a60 |
113330121312 has 48 divisors (see below), whose sum is σ = 298736363520. Its totient is φ = 37618637952.
The previous prime is 113330121283. The next prime is 113330121343. The reversal of 113330121312 is 213121033311.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2446768 + ... + 2492655.
It is an arithmetic number, because the mean of its divisors is an integer number (6223674240).
Almost surely, 2113330121312 is an apocalyptic number.
113330121312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113330121312 is an abundant number, since it is smaller than the sum of its proper divisors (185406242208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113330121312 is a wasteful number, since it uses less digits than its factorization.
113330121312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4939675 (or 4939667 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113330121312 its reverse (213121033311), we get a palindrome (326451154623).
The spelling of 113330121312 in words is "one hundred thirteen billion, three hundred thirty million, one hundred twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •