Base | Representation |
---|---|
bin | 1100000111111111000101… |
… | …0000010010110111110111 |
3 | 1202012110111101102100112022 |
4 | 3001333301100102313313 |
5 | 3221410031230201101 |
6 | 44204155015543355 |
7 | 2544104545443251 |
oct | 301776120226767 |
9 | 52173441370468 |
10 | 13331331100151 |
11 | 427a87094a299 |
12 | 15b384b98ab5b |
13 | 7591a6885a2c |
14 | 3413502aacd1 |
15 | 181ba2754a1b |
hex | c1ff1412df7 |
13331331100151 has 8 divisors (see below), whose sum is σ = 13791081118320. Its totient is φ = 12871584345088.
The previous prime is 13331331100141. The next prime is 13331331100177. The reversal of 13331331100151 is 15100113313331.
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 13331331100151 - 222 = 13331326905847 is a prime.
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 13331331100151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331331100141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9867575 + ... + 11136951.
It is an arithmetic number, because the mean of its divisors is an integer number (1723885139790).
Almost surely, 213331331100151 is an apocalyptic number.
13331331100151 is a deficient number, since it is larger than the sum of its proper divisors (459750018169).
13331331100151 is a wasteful number, since it uses less digits than its factorization.
13331331100151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631553.
The product of its (nonzero) digits is 1215, while the sum is 26.
Adding to 13331331100151 its reverse (15100113313331), we get a palindrome (28431444413482).
The spelling of 13331331100151 in words is "thirteen trillion, three hundred thirty-one billion, three hundred thirty-one million, one hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •