Base | Representation |
---|---|
bin | 1110100101010001110… |
… | …1001001011011010001 |
3 | 212221122112001011000102 |
4 | 3221110131021123101 |
5 | 13101033401430342 |
6 | 311031204502145 |
7 | 24046146422516 |
oct | 3512435113321 |
9 | 787575034012 |
10 | 250525030097 |
11 | 97279937121 |
12 | 406783aa955 |
13 | 1a816a98aa4 |
14 | c1a844130d |
15 | 67b3e78832 |
hex | 3a547496d1 |
250525030097 has 2 divisors, whose sum is σ = 250525030098. Its totient is φ = 250525030096.
The previous prime is 250525030069. The next prime is 250525030103. The reversal of 250525030097 is 790030525052.
250525030097 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., 208411423441 + 42113606656 = 456521^2 + 205216^2 .
It is a cyclic number.
It is not a de Polignac number, because 250525030097 - 26 = 250525030033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 250525030097.
It is not a weakly prime, because it can be changed into another prime (250525930097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125262515048 + 125262515049.
It is an arithmetic number, because the mean of its divisors is an integer number (125262515049).
Almost surely, 2250525030097 is an apocalyptic number.
It is an amenable number.
250525030097 is a deficient number, since it is larger than the sum of its proper divisors (1).
250525030097 is an equidigital number, since it uses as much as digits as its factorization.
250525030097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 94500, while the sum is 38.
The spelling of 250525030097 in words is "two hundred fifty billion, five hundred twenty-five million, thirty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •