Base | Representation |
---|---|
bin | 101000001000010010000… |
… | …1100101001011100001111 |
3 | 201112021001220020000102210 |
4 | 1100100210030221130033 |
5 | 1210330411344201221 |
6 | 15421414210521503 |
7 | 1106320253364234 |
oct | 120204414513417 |
9 | 21467056200383 |
10 | 5515345303311 |
11 | 1837054703508 |
12 | 750ab1b96293 |
13 | 31013045b56c |
14 | 150d309d778b |
15 | 98700626276 |
hex | 5042432970f |
5515345303311 has 4 divisors (see below), whose sum is σ = 7353793737752. Its totient is φ = 3676896868872.
The previous prime is 5515345303277. The next prime is 5515345303357. The reversal of 5515345303311 is 1133035435155.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5515345303311 - 27 = 5515345303183 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 5515345303311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5515345303361) 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 3 ways as a sum of consecutive naturals, for example, 919224217216 + ... + 919224217221.
It is an arithmetic number, because the mean of its divisors is an integer number (1838448434438).
Almost surely, 25515345303311 is an apocalyptic number.
5515345303311 is a deficient number, since it is larger than the sum of its proper divisors (1838448434441).
5515345303311 is a wasteful number, since it uses less digits than its factorization.
5515345303311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838448434440.
The product of its (nonzero) digits is 202500, while the sum is 39.
The spelling of 5515345303311 in words is "five trillion, five hundred fifteen billion, three hundred forty-five million, three hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •