Base | Representation |
---|---|
bin | 11001100010010111101001… |
… | …101110001011111100111101 |
3 | 112201200000112112200010001211 |
4 | 121202113221232023330331 |
5 | 104210114031340201023 |
6 | 1034511520051404421 |
7 | 32441230235021500 |
oct | 3142275156137475 |
9 | 481600475603054 |
10 | 112313021022013 |
11 | 32871759410899 |
12 | 1071b0235b3711 |
13 | 4a890c31b6786 |
14 | 1da3d9cdb1137 |
15 | ceb7bd0a4a0d |
hex | 6625e9b8bf3d |
112313021022013 has 24 divisors (see below), whose sum is σ = 134211485240064. Its totient is φ = 93645119584800.
The previous prime is 112313021021959. The next prime is 112313021022019. The reversal of 112313021022013 is 310220120313211.
It is not a de Polignac number, because 112313021022013 - 29 = 112313021021501 is a prime.
It is a super-2 number, since 2×1123130210220132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112313021022019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 906828 + ... + 15014938.
It is an arithmetic number, because the mean of its divisors is an integer number (5592145218336).
Almost surely, 2112313021022013 is an apocalyptic number.
It is an amenable number.
112313021022013 is a deficient number, since it is larger than the sum of its proper divisors (21898464218051).
112313021022013 is a wasteful number, since it uses less digits than its factorization.
112313021022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14112553 (or 14112546 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112313021022013 its reverse (310220120313211), we get a palindrome (422533141335224).
The spelling of 112313021022013 in words is "one hundred twelve trillion, three hundred thirteen billion, twenty-one million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •