Base | Representation |
---|---|
bin | 111000110110011010100101… |
… | …010110001110000111011001 |
3 | 1012210021122010121112011101221 |
4 | 320312122211112032013121 |
5 | 230232442420030004334 |
6 | 2243434110232012041 |
7 | 103444033326603553 |
oct | 7066324526160731 |
9 | 1183248117464357 |
10 | 250030000234969 |
11 | 72738144955a59 |
12 | 240615a5231021 |
13 | a968960129b86 |
14 | 45a57336d84d3 |
15 | 1dd8cc28728b4 |
hex | e366a558e1d9 |
250030000234969 has 2 divisors, whose sum is σ = 250030000234970. Its totient is φ = 250030000234968.
The previous prime is 250030000234967. The next prime is 250030000235047. The reversal of 250030000234969 is 969432000030052.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 170887981642569 + 79142018592400 = 13072413^2 + 8896180^2 .
It is a cyclic number.
It is not a de Polignac number, because 250030000234969 - 21 = 250030000234967 is a prime.
It is a super-2 number, since 2×2500300002349692 (a number of 30 digits) contains 22 as substring.
Together with 250030000234967, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (250030000234967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125015000117484 + 125015000117485.
It is an arithmetic number, because the mean of its divisors is an integer number (125015000117485).
Almost surely, 2250030000234969 is an apocalyptic number.
It is an amenable number.
250030000234969 is a deficient number, since it is larger than the sum of its proper divisors (1).
250030000234969 is an equidigital number, since it uses as much as digits as its factorization.
250030000234969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 43.
The spelling of 250030000234969 in words is "two hundred fifty trillion, thirty billion, two hundred thirty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •