Base | Representation |
---|---|
bin | 110100101101111011… |
… | …0010001001000101000 |
3 | 101211012210210001220022 |
4 | 1221123312101020220 |
5 | 3323323241233222 |
6 | 124001421220012 |
7 | 11115310664216 |
oct | 1513366211050 |
9 | 354183701808 |
10 | 113210102312 |
11 | 4401517352a |
12 | 19b35a01608 |
13 | a8a2594a28 |
14 | 569d67bcb6 |
15 | 2e28d3e042 |
hex | 1a5bd91228 |
113210102312 has 8 divisors (see below), whose sum is σ = 212268941850. Its totient is φ = 56605051152.
The previous prime is 113210102297. The next prime is 113210102323. The reversal of 113210102312 is 213201012311.
113210102312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 82901381476 + 30308720836 = 287926^2 + 174094^2 .
It is a tau number, because it is divible by the number of its divisors (8).
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 as a sum of consecutive naturals, namely, 7075631387 + ... + 7075631402.
Almost surely, 2113210102312 is an apocalyptic number.
It is an amenable number.
113210102312 is a deficient number, since it is larger than the sum of its proper divisors (99058839538).
113210102312 is a wasteful number, since it uses less digits than its factorization.
113210102312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14151262795 (or 14151262791 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 113210102312 its reverse (213201012311), we get a palindrome (326411114623).
Subtracting 113210102312 from its reverse (213201012311), we obtain a palindrome (99990909999).
The spelling of 113210102312 in words is "one hundred thirteen billion, two hundred ten million, one hundred two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •