Base | Representation |
---|---|
bin | 100110100100011110001… |
… | …000110111111000010101 |
3 | 100101101101221020021211101 |
4 | 212210132020313320111 |
5 | 321411211104323044 |
6 | 5345342331310101 |
7 | 362330605135006 |
oct | 46443610677025 |
9 | 10341357207741 |
10 | 2650500464149 |
11 | 93208646056a |
12 | 3698272ab331 |
13 | 162c30849a15 |
14 | 923dbadb1ad |
15 | 48e2b5eacd4 |
hex | 2691e237e15 |
2650500464149 has 2 divisors, whose sum is σ = 2650500464150. Its totient is φ = 2650500464148.
The previous prime is 2650500464081. The next prime is 2650500464203. The reversal of 2650500464149 is 9414640050562.
2650500464149 is digitally balanced in base 2, 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., 2611640227249 + 38860236900 = 1616057^2 + 197130^2 .
It is a cyclic number.
It is not a de Polignac number, because 2650500464149 - 217 = 2650500333077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2650500464099 and 2650500464108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2650500467149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1325250232074 + 1325250232075.
It is an arithmetic number, because the mean of its divisors is an integer number (1325250232075).
Almost surely, 22650500464149 is an apocalyptic number.
It is an amenable number.
2650500464149 is a deficient number, since it is larger than the sum of its proper divisors (1).
2650500464149 is an equidigital number, since it uses as much as digits as its factorization.
2650500464149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 2650500464149 in words is "two trillion, six hundred fifty billion, five hundred million, four hundred sixty-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •