Base | Representation |
---|---|
bin | 110100001100110110… |
… | …0110000001111001101 |
3 | 101201100110111212210220 |
4 | 1220121230300033031 |
5 | 3314040134441023 |
6 | 123255334421553 |
7 | 11045643634044 |
oct | 1503154601715 |
9 | 351313455726 |
10 | 112100312013 |
11 | 435a5781668 |
12 | 198862018b9 |
13 | a756696a91 |
14 | 55d611155b |
15 | 2db16c23e3 |
hex | 1a19b303cd |
112100312013 has 8 divisors (see below), whose sum is σ = 151917362976. Its totient is φ = 73508401200.
The previous prime is 112100311927. The next prime is 112100312047. The reversal of 112100312013 is 310213001211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112100312013 - 216 = 112100246477 is a prime.
It is a super-2 number, since 2×1121003120132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112100311983 and 112100312001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112100312083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 306284823 + ... + 306285188.
It is an arithmetic number, because the mean of its divisors is an integer number (18989670372).
Almost surely, 2112100312013 is an apocalyptic number.
It is an amenable number.
112100312013 is a deficient number, since it is larger than the sum of its proper divisors (39817050963).
112100312013 is an equidigital number, since it uses as much as digits as its factorization.
112100312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612570075.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 112100312013 its reverse (310213001211), we get a palindrome (422313313224).
The spelling of 112100312013 in words is "one hundred twelve billion, one hundred million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •