Base | Representation |
---|---|
bin | 1011110101010110001111… |
… | …1001110001110010010101 |
3 | 1201001212000011101020202122 |
4 | 2331111203321301302111 |
5 | 3201133244244430401 |
6 | 43401122002345325 |
7 | 2512010660321552 |
oct | 275254371616225 |
9 | 51055004336678 |
10 | 13011132030101 |
11 | 4166a98916777 |
12 | 156178995b245 |
13 | 734c3805c58a |
14 | 32da56663a29 |
15 | 1786b1b0621b |
hex | bd563e71c95 |
13011132030101 has 16 divisors (see below), whose sum is σ = 14112712373760. Its totient is φ = 11946918213120.
The previous prime is 13011132030047. The next prime is 13011132030119. The reversal of 13011132030101 is 10103023111031.
It is a cyclic number.
It is not a de Polignac number, because 13011132030101 - 242 = 8613085518997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13011132030101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011132030161) 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, 86086940 + ... + 86237946.
It is an arithmetic number, because the mean of its divisors is an integer number (882044523360).
Almost surely, 213011132030101 is an apocalyptic number.
It is an amenable number.
13011132030101 is a deficient number, since it is larger than the sum of its proper divisors (1101580343659).
13011132030101 is a wasteful number, since it uses less digits than its factorization.
13011132030101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274684.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 13011132030101 its reverse (10103023111031), we get a palindrome (23114155141132).
The spelling of 13011132030101 in words is "thirteen trillion, eleven billion, one hundred thirty-two million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •