Base | Representation |
---|---|
bin | 101000010100011110000… |
… | …0010101000000101111001 |
3 | 201121202121201101010022112 |
4 | 1100220330002220011321 |
5 | 1211243010333231210 |
6 | 15441423101102105 |
7 | 1111234624306544 |
oct | 120507402500571 |
9 | 21552551333275 |
10 | 5541515133305 |
11 | 184716390a088 |
12 | 755b96257935 |
13 | 312741154a78 |
14 | 1522d449985b |
15 | 99232d74d05 |
hex | 50a3c0a8179 |
5541515133305 has 4 divisors (see below), whose sum is σ = 6649818159972. Its totient is φ = 4433212106640.
The previous prime is 5541515133269. The next prime is 5541515133307. The reversal of 5541515133305 is 5033315151455.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 737913642361 + 4803601490944 = 859019^2 + 2191712^2 .
It is not a de Polignac number, because 5541515133305 - 224 = 5541498356089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5541515133307) 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, 554151513326 + ... + 554151513335.
It is an arithmetic number, because the mean of its divisors is an integer number (1662454539993).
Almost surely, 25541515133305 is an apocalyptic number.
It is an amenable number.
5541515133305 is a deficient number, since it is larger than the sum of its proper divisors (1108303026667).
5541515133305 is a wasteful number, since it uses less digits than its factorization.
5541515133305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108303026666.
The product of its (nonzero) digits is 337500, while the sum is 41.
The spelling of 5541515133305 in words is "five trillion, five hundred forty-one billion, five hundred fifteen million, one hundred thirty-three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •