Base | Representation |
---|---|
bin | 110100101110001110… |
… | …1100011100000010100 |
3 | 101211020112011022021120 |
4 | 1221130131203200110 |
5 | 3323333410314142 |
6 | 124002430043540 |
7 | 11115464350104 |
oct | 1513435434024 |
9 | 354215138246 |
10 | 113220401172 |
11 | 4401aa6818a |
12 | 19b393495b0 |
13 | a8a475c628 |
14 | 56a0b9d204 |
15 | 2e29bc57ec |
hex | 1a5c763814 |
113220401172 has 12 divisors (see below), whose sum is σ = 264180936096. Its totient is φ = 37740133720.
The previous prime is 113220401167. The next prime is 113220401201. The reversal of 113220401172 is 271104022311.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4717516704 + ... + 4717516727.
It is an arithmetic number, because the mean of its divisors is an integer number (22015078008).
Almost surely, 2113220401172 is an apocalyptic number.
113220401172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113220401172 is an abundant number, since it is smaller than the sum of its proper divisors (150960534924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113220401172 is a wasteful number, since it uses less digits than its factorization.
113220401172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9435033438 (or 9435033436 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
Adding to 113220401172 its reverse (271104022311), we get a palindrome (384324423483).
The spelling of 113220401172 in words is "one hundred thirteen billion, two hundred twenty million, four hundred one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •