Base | Representation |
---|---|
bin | 110011110010011000… |
… | …1010000101011100111 |
3 | 101122001120120020202021 |
4 | 1213210301100223213 |
5 | 3310230322113111 |
6 | 123031253324011 |
7 | 11014641650536 |
oct | 1474461205347 |
9 | 348046506667 |
10 | 111212301031 |
11 | 4318a498897 |
12 | 19678936607 |
13 | a64470a3b0 |
14 | 55501d631d |
15 | 2d5d762d71 |
hex | 19e4c50ae7 |
111212301031 has 16 divisors (see below), whose sum is σ = 120326629248. Its totient is φ = 102179001600.
The previous prime is 111212301023. The next prime is 111212301041. The reversal of 111212301031 is 130103212111.
It is a happy number.
It is not a de Polignac number, because 111212301031 - 23 = 111212301023 is a prime.
It is a super-2 number, since 2×1112123010312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111212300996 and 111212301014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111212301001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2463321 + ... + 2508061.
It is an arithmetic number, because the mean of its divisors is an integer number (7520414328).
Almost surely, 2111212301031 is an apocalyptic number.
111212301031 is a deficient number, since it is larger than the sum of its proper divisors (9114328217).
111212301031 is a wasteful number, since it uses less digits than its factorization.
111212301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45642.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111212301031 its reverse (130103212111), we get a palindrome (241315513142).
The spelling of 111212301031 in words is "one hundred eleven billion, two hundred twelve million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •