Base | Representation |
---|---|
bin | 11101101100000101100… |
… | …00111010110011100101 |
3 | 10121112001121012122222010 |
4 | 32312002300322303211 |
5 | 113203131341023023 |
6 | 2100343351024433 |
7 | 133462025243145 |
oct | 16660260726345 |
9 | 3545047178863 |
10 | 1020101111013 |
11 | 363693535136 |
12 | 14585196b119 |
13 | 7526c8b587a |
14 | 37531d2c925 |
15 | 1b806306093 |
hex | ed82c3ace5 |
1020101111013 has 16 divisors (see below), whose sum is σ = 1388168399552. Its totient is φ = 666143136000.
The previous prime is 1020101111011. The next prime is 1020101111017. The reversal of 1020101111013 is 3101111010201.
It is not a de Polignac number, because 1020101111013 - 21 = 1020101111011 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020101111013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020101111011) 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, 11520883 + ... + 11609088.
It is an arithmetic number, because the mean of its divisors is an integer number (86760524972).
Almost surely, 21020101111013 is an apocalyptic number.
It is an amenable number.
1020101111013 is a deficient number, since it is larger than the sum of its proper divisors (368067288539).
1020101111013 is a wasteful number, since it uses less digits than its factorization.
1020101111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23130276.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 1020101111013 its reverse (3101111010201), we get a palindrome (4121212121214).
The spelling of 1020101111013 in words is "one trillion, twenty billion, one hundred one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •