Base | Representation |
---|---|
bin | 1001100101011110… |
… | …1011001010000011 |
3 | 20122022210001020121 |
4 | 2121113223022003 |
5 | 20232204321011 |
6 | 1103154521111 |
7 | 120523105651 |
oct | 23127531203 |
9 | 6568701217 |
10 | 2573120131 |
11 | 110050626a |
12 | 5b9896197 |
13 | 3201211ba |
14 | 1a5a45dd1 |
15 | 100d70e71 |
hex | 995eb283 |
2573120131 has 2 divisors, whose sum is σ = 2573120132. Its totient is φ = 2573120130.
The previous prime is 2573120111. The next prime is 2573120177. The reversal of 2573120131 is 1310213752.
It is a happy number.
2573120131 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 is a cyclic number.
It is not a de Polignac number, because 2573120131 - 217 = 2572989059 is a prime.
It is a super-2 number, since 2×25731201312 = 13241894417114914322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2573120096 and 2573120105.
It is not a weakly prime, because it can be changed into another prime (2573120111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1286560065 + 1286560066.
It is an arithmetic number, because the mean of its divisors is an integer number (1286560066).
Almost surely, 22573120131 is an apocalyptic number.
2573120131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2573120131 is an equidigital number, since it uses as much as digits as its factorization.
2573120131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 2573120131 is about 50725.9315439352. The cubic root of 2573120131 is about 1370.3137667326.
Adding to 2573120131 its reverse (1310213752), we get a palindrome (3883333883).
The spelling of 2573120131 in words is "two billion, five hundred seventy-three million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •