Base | Representation |
---|---|
bin | 11000010001011101… |
… | …00101010101001111 |
3 | 1020122011202012201111 |
4 | 30020232211111033 |
5 | 203142010044101 |
6 | 5553030352451 |
7 | 640633326046 |
oct | 141056452517 |
9 | 36564665644 |
10 | 13031331151 |
11 | 5587934a73 |
12 | 26381bb727 |
13 | 12c8a21847 |
14 | 8b89a355d |
15 | 514090251 |
hex | 308ba554f |
13031331151 has 8 divisors (see below), whose sum is σ = 13483814400. Its totient is φ = 12580855320.
The previous prime is 13031331083. The next prime is 13031331199. The reversal of 13031331151 is 15113313031.
13031331151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13031331151 - 27 = 13031331023 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 (13031331451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488641 + ... + 514618.
It is an arithmetic number, because the mean of its divisors is an integer number (1685476800).
Almost surely, 213031331151 is an apocalyptic number.
13031331151 is a deficient number, since it is larger than the sum of its proper divisors (452483249).
13031331151 is a wasteful number, since it uses less digits than its factorization.
13031331151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003709.
The product of its (nonzero) digits is 405, while the sum is 22.
Adding to 13031331151 its reverse (15113313031), we get a palindrome (28144644182).
The spelling of 13031331151 in words is "thirteen billion, thirty-one million, three hundred thirty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •