Base | Representation |
---|---|
bin | 10011000100111110010… |
… | …010110000100010110101 |
3 | 11122022221112212000100111 |
4 | 103010332102300202311 |
5 | 132434422043130401 |
6 | 2442134132543021 |
7 | 163501024145140 |
oct | 23047622604265 |
9 | 4568845760314 |
10 | 1311010130101 |
11 | 465aa6049971 |
12 | 1920ba781a71 |
13 | 9682115a919 |
14 | 4764b935057 |
15 | 24180815e51 |
hex | 1313e4b08b5 |
1311010130101 has 16 divisors (see below), whose sum is σ = 1503449985024. Its totient is φ = 1119862301184.
The previous prime is 1311010130083. The next prime is 1311010130117. The reversal of 1311010130101 is 1010310101131.
It is a cyclic number.
It is not a de Polignac number, because 1311010130101 - 215 = 1311010097333 is a prime.
It is a super-2 number, since 2×13110101301012 (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 (1311010130141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3949755 + ... + 4268791.
It is an arithmetic number, because the mean of its divisors is an integer number (93965624064).
Almost surely, 21311010130101 is an apocalyptic number.
It is an amenable number.
1311010130101 is a deficient number, since it is larger than the sum of its proper divisors (192439854923).
1311010130101 is a wasteful number, since it uses less digits than its factorization.
1311010130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321060.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1311010130101 its reverse (1010310101131), we get a palindrome (2321320231232).
The spelling of 1311010130101 in words is "one trillion, three hundred eleven billion, ten million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •