Base | Representation |
---|---|
bin | 1011100110101011… |
… | …1111010000110101 |
3 | 22001002112010221022 |
4 | 2321222333100311 |
5 | 22334423213013 |
6 | 1233034230525 |
7 | 140123344322 |
oct | 27152772065 |
9 | 8032463838 |
10 | 3115054133 |
11 | 1359404304 |
12 | 72b285445 |
13 | 3a84991c9 |
14 | 2179d5b49 |
15 | 13371e008 |
hex | b9abf435 |
3115054133 has 2 divisors, whose sum is σ = 3115054134. Its totient is φ = 3115054132.
The previous prime is 3115054097. The next prime is 3115054139. The reversal of 3115054133 is 3314505113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3044611684 + 70442449 = 55178^2 + 8393^2 .
It is a cyclic number.
It is not a de Polignac number, because 3115054133 - 26 = 3115054069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3115054139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1557527066 + 1557527067.
It is an arithmetic number, because the mean of its divisors is an integer number (1557527067).
Almost surely, 23115054133 is an apocalyptic number.
It is an amenable number.
3115054133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3115054133 is an equidigital number, since it uses as much as digits as its factorization.
3115054133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 3115054133 is about 55812.6700042204. The cubic root of 3115054133 is about 1460.4561864953.
Adding to 3115054133 its reverse (3314505113), we get a palindrome (6429559246).
The spelling of 3115054133 in words is "three billion, one hundred fifteen million, fifty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •