Base | Representation |
---|---|
bin | 101011000100101110100… |
… | …011111001001010010001 |
3 | 101110222022102212010010012 |
4 | 223010232203321022101 |
5 | 341444101442044144 |
6 | 10143451140444305 |
7 | 423565616463152 |
oct | 53045643711221 |
9 | 11428272763105 |
10 | 2960013628049 |
11 | a41375586695 |
12 | 3b98066a9695 |
13 | 18618853c69a |
14 | a33a0475929 |
15 | 51ee404ee9e |
hex | 2b12e8f9291 |
2960013628049 has 2 divisors, whose sum is σ = 2960013628050. Its totient is φ = 2960013628048.
The previous prime is 2960013628007. The next prime is 2960013628057. The reversal of 2960013628049 is 9408263100692.
2960013628049 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2224094995600 + 735918632449 = 1491340^2 + 857857^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2960013628049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2960013627988 and 2960013628006.
It is not a weakly prime, because it can be changed into another prime (2960013628349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1480006814024 + 1480006814025.
It is an arithmetic number, because the mean of its divisors is an integer number (1480006814025).
Almost surely, 22960013628049 is an apocalyptic number.
It is an amenable number.
2960013628049 is a deficient number, since it is larger than the sum of its proper divisors (1).
2960013628049 is an equidigital number, since it uses as much as digits as its factorization.
2960013628049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1119744, while the sum is 50.
The spelling of 2960013628049 in words is "two trillion, nine hundred sixty billion, thirteen million, six hundred twenty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •