Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0100000111100001000111 |
3 | 1201102100001102220202220111 |
4 | 2332301330210013201013 |
5 | 3204244423441431101 |
6 | 43514445200013451 |
7 | 2522122125364024 |
oct | 276617444074107 |
9 | 51370042822814 |
10 | 13110330030151 |
11 | 41a50725753a2 |
12 | 1578a53001287 |
13 | 7413b6668a23 |
14 | 334786d9854b |
15 | 17b06a721251 |
hex | bec7c907847 |
13110330030151 has 4 divisors (see below), whose sum is σ = 13680344379312. Its totient is φ = 12540315680992.
The previous prime is 13110330030139. The next prime is 13110330030167. The reversal of 13110330030151 is 15103003301131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13110330030151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110330030101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285007174546 + ... + 285007174591.
It is an arithmetic number, because the mean of its divisors is an integer number (3420086094828).
Almost surely, 213110330030151 is an apocalyptic number.
13110330030151 is a deficient number, since it is larger than the sum of its proper divisors (570014349161).
13110330030151 is an equidigital number, since it uses as much as digits as its factorization.
13110330030151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570014349160.
The product of its (nonzero) digits is 405, while the sum is 22.
Adding to 13110330030151 its reverse (15103003301131), we get a palindrome (28213333331282).
The spelling of 13110330030151 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •