Base | Representation |
---|---|
bin | 100101101101001011110… |
… | …111000110001101100011 |
3 | 100011201011212022101010111 |
4 | 211231023313012031203 |
5 | 314423122312422201 |
6 | 5302204040112151 |
7 | 355126546501246 |
oct | 45551367061543 |
9 | 10151155271114 |
10 | 2591138014051 |
11 | 909993949154 |
12 | 35a21aa65657 |
13 | 15a4602049c2 |
14 | 8d5a9ba725d |
15 | 47604d31b51 |
hex | 25b4bdc6363 |
2591138014051 has 2 divisors, whose sum is σ = 2591138014052. Its totient is φ = 2591138014050.
The previous prime is 2591138014033. The next prime is 2591138014061. The reversal of 2591138014051 is 1504108311952.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2591138014051 - 25 = 2591138014019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2591138013995 and 2591138014013.
It is not a weakly prime, because it can be changed into another prime (2591138014001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1295569007025 + 1295569007026.
It is an arithmetic number, because the mean of its divisors is an integer number (1295569007026).
Almost surely, 22591138014051 is an apocalyptic number.
2591138014051 is a deficient number, since it is larger than the sum of its proper divisors (1).
2591138014051 is an equidigital number, since it uses as much as digits as its factorization.
2591138014051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 40.
The spelling of 2591138014051 in words is "two trillion, five hundred ninety-one billion, one hundred thirty-eight million, fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •