Base | Representation |
---|---|
bin | 11101111110101101101… |
… | …00101001111101001111 |
3 | 10122110212112100110211221 |
4 | 32333112310221331033 |
5 | 113334121413430221 |
6 | 2105115542024211 |
7 | 134264604451102 |
oct | 16772664517517 |
9 | 3573775313757 |
10 | 1030101311311 |
11 | 367955376686 |
12 | 147782a18067 |
13 | 761a4643257 |
14 | 37c00104739 |
15 | 1bbde203541 |
hex | efd6d29f4f |
1030101311311 has 12 divisors (see below), whose sum is σ = 1094729622552. Its totient is φ = 969090919808.
The previous prime is 1030101311287. The next prime is 1030101311321. The reversal of 1030101311311 is 1131131010301.
It is a de Polignac number, because none of the positive numbers 2k-1030101311311 is a prime.
It is a super-2 number, since 2×10301013113112 (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 (1030101311321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89665 + ... + 1438138.
It is an arithmetic number, because the mean of its divisors is an integer number (91227468546).
Almost surely, 21030101311311 is an apocalyptic number.
1030101311311 is a deficient number, since it is larger than the sum of its proper divisors (64628311241).
1030101311311 is a wasteful number, since it uses less digits than its factorization.
1030101311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530170 (or 1530153 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1030101311311 its reverse (1131131010301), we get a palindrome (2161232321612).
The spelling of 1030101311311 in words is "one trillion, thirty billion, one hundred one million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •