Base | Representation |
---|---|
bin | 101101100100101001010010… |
… | …001010100001001100011001 |
3 | 222021122221200210000002200111 |
4 | 231210221102022201030121 |
5 | 202232322300003333444 |
6 | 1550140230254204321 |
7 | 60134420142603313 |
oct | 5544512212411431 |
9 | 867587623002614 |
10 | 200430322324249 |
11 | 58955027820756 |
12 | 1a5908a54b36a1 |
13 | 87ab6629a8404 |
14 | 376cc44d767b3 |
15 | 18289bca30234 |
hex | b64a522a1319 |
200430322324249 has 2 divisors, whose sum is σ = 200430322324250. Its totient is φ = 200430322324248.
The previous prime is 200430322324147. The next prime is 200430322324339. The reversal of 200430322324249 is 942423223034002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138960645456649 + 61469676867600 = 11788157^2 + 7840260^2 .
It is a cyclic number.
It is not a de Polignac number, because 200430322324249 - 211 = 200430322322201 is a prime.
It is a super-2 number, since 2×2004303223242492 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200430322324649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100215161162124 + 100215161162125.
It is an arithmetic number, because the mean of its divisors is an integer number (100215161162125).
Almost surely, 2200430322324249 is an apocalyptic number.
It is an amenable number.
200430322324249 is a deficient number, since it is larger than the sum of its proper divisors (1).
200430322324249 is an equidigital number, since it uses as much as digits as its factorization.
200430322324249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 497664, while the sum is 40.
The spelling of 200430322324249 in words is "two hundred trillion, four hundred thirty billion, three hundred twenty-two million, three hundred twenty-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •