Base | Representation |
---|---|
bin | 10001110001001010011… |
… | …110000101010010001101 |
3 | 11022201122222202102211121 |
4 | 101301022132011102031 |
5 | 130001122122041023 |
6 | 2332532350320541 |
7 | 154134005464312 |
oct | 21611236052215 |
9 | 4281588672747 |
10 | 1221020112013 |
11 | 430917026399 |
12 | 1787851b9151 |
13 | 8b1ac421c00 |
14 | 431520b4d09 |
15 | 21b652abd5d |
hex | 11c4a78548d |
1221020112013 has 24 divisors (see below), whose sum is σ = 1347347613312. Its totient is φ = 1105639674048.
The previous prime is 1221020111963. The next prime is 1221020112017. The reversal of 1221020112013 is 3102110201221.
It is not a de Polignac number, because 1221020112013 - 233 = 1212430177421 is a prime.
It is a super-2 number, since 2×12210201120132 (a number of 25 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 (1221020112017) 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, 97651920 + ... + 97664422.
It is an arithmetic number, because the mean of its divisors is an integer number (56139483888).
Almost surely, 21221020112013 is an apocalyptic number.
1221020112013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1221020112013 is a deficient number, since it is larger than the sum of its proper divisors (126327501299).
1221020112013 is a wasteful number, since it uses less digits than its factorization.
1221020112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23485 (or 23472 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1221020112013 its reverse (3102110201221), we get a palindrome (4323130313234).
The spelling of 1221020112013 in words is "one trillion, two hundred twenty-one billion, twenty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •