Base | Representation |
---|---|
bin | 100100011101111010011… |
… | …110011001001010001001 |
3 | 22212120110220002220010222 |
4 | 210131322132121022021 |
5 | 312024312301040124 |
6 | 5155130001115425 |
7 | 346024346444621 |
oct | 44357236311211 |
9 | 8776426086128 |
10 | 2506020721289 |
11 | 8868854022a8 |
12 | 345825328b75 |
13 | 152416b54707 |
14 | 89413557881 |
15 | 452c248d25e |
hex | 2477a799289 |
2506020721289 has 2 divisors, whose sum is σ = 2506020721290. Its totient is φ = 2506020721288.
The previous prime is 2506020721279. The next prime is 2506020721333. The reversal of 2506020721289 is 9821270206052.
2506020721289 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (2506020721333) can be obtained adding 2506020721289 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2342062944400 + 163957776889 = 1530380^2 + 404917^2 .
It is a cyclic number.
It is not a de Polignac number, because 2506020721289 - 24 = 2506020721273 is a prime.
It is not a weakly prime, because it can be changed into another prime (2506020721229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1253010360644 + 1253010360645.
It is an arithmetic number, because the mean of its divisors is an integer number (1253010360645).
Almost surely, 22506020721289 is an apocalyptic number.
It is an amenable number.
2506020721289 is a deficient number, since it is larger than the sum of its proper divisors (1).
2506020721289 is an equidigital number, since it uses as much as digits as its factorization.
2506020721289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 241920, while the sum is 44.
The spelling of 2506020721289 in words is "two trillion, five hundred six billion, twenty million, seven hundred twenty-one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •