Base | Representation |
---|---|
bin | 1001011100000010… |
… | …1100110011110101 |
3 | 20112120022022211202 |
4 | 2113000230303311 |
5 | 20142041340112 |
6 | 1055222342245 |
7 | 116532522125 |
oct | 22700546365 |
9 | 6476268752 |
10 | 2533543157 |
11 | 1090134522 |
12 | 5a858a985 |
13 | 314b75082 |
14 | 1a06a2c85 |
15 | ec6546c2 |
hex | 9702ccf5 |
2533543157 has 2 divisors, whose sum is σ = 2533543158. Its totient is φ = 2533543156.
The previous prime is 2533543147. The next prime is 2533543241. The reversal of 2533543157 is 7513453352.
2533543157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2504101681 + 29441476 = 50041^2 + 5426^2 .
It is a cyclic number.
It is not a de Polignac number, because 2533543157 - 222 = 2529348853 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2533543157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2533543147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1266771578 + 1266771579.
It is an arithmetic number, because the mean of its divisors is an integer number (1266771579).
Almost surely, 22533543157 is an apocalyptic number.
It is an amenable number.
2533543157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2533543157 is an equidigital number, since it uses as much as digits as its factorization.
2533543157 is an evil number, because the sum of its binary digits is even.
The product of its digits is 189000, while the sum is 38.
The square root of 2533543157 is about 50334.3139120819. The cubic root of 2533543157 is about 1363.2518703139.
The spelling of 2533543157 in words is "two billion, five hundred thirty-three million, five hundred forty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •