Base | Representation |
---|---|
bin | 11101010010111101010… |
… | …101111010010010000101 |
3 | 21010110110212010002222210 |
4 | 131102331111322102011 |
5 | 230441034130111401 |
6 | 4140510000014033 |
7 | 265310333654550 |
oct | 35227525722205 |
9 | 7113425102883 |
10 | 2013221332101 |
11 | 706890a59331 |
12 | 286213901319 |
13 | 117acc74bbc5 |
14 | 6d624791697 |
15 | 3757da9e4d6 |
hex | 1d4bd57a485 |
2013221332101 has 16 divisors (see below), whose sum is σ = 3229227200000. Its totient is φ = 1089864179568.
The previous prime is 2013221332093. The next prime is 2013221332169. The reversal of 2013221332101 is 1012331223102.
It is not a de Polignac number, because 2013221332101 - 23 = 2013221332093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013221332181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2522833351 + ... + 2522834148.
It is an arithmetic number, because the mean of its divisors is an integer number (201826700000).
Almost surely, 22013221332101 is an apocalyptic number.
2013221332101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2013221332101 is a deficient number, since it is larger than the sum of its proper divisors (1216005867899).
2013221332101 is a wasteful number, since it uses less digits than its factorization.
2013221332101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5045667528.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2013221332101 its reverse (1012331223102), we get a palindrome (3025552555203).
The spelling of 2013221332101 in words is "two trillion, thirteen billion, two hundred twenty-one million, three hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •