Base | Representation |
---|---|
bin | 101101100001101110110101… |
… | …010110110100101100010101 |
3 | 222020221210221112201021200101 |
4 | 231201232311112310230111 |
5 | 202221032242444000232 |
6 | 1545504240524414101 |
7 | 60114102051645331 |
oct | 5541566526645425 |
9 | 866853845637611 |
10 | 200230123031317 |
11 | 5888813350a855 |
12 | 1a559b330a7331 |
13 | 87958092bba32 |
14 | 37632926187c1 |
15 | 18236a1d411e7 |
hex | b61bb55b4b15 |
200230123031317 has 2 divisors, whose sum is σ = 200230123031318. Its totient is φ = 200230123031316.
The previous prime is 200230123031269. The next prime is 200230123031363. The reversal of 200230123031317 is 713130321032002.
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., 187126367383396 + 13103755647921 = 13679414^2 + 3619911^2 .
It is a cyclic number.
It is not a de Polignac number, because 200230123031317 - 231 = 200227975547669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200230123031717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100115061515658 + 100115061515659.
It is an arithmetic number, because the mean of its divisors is an integer number (100115061515659).
Almost surely, 2200230123031317 is an apocalyptic number.
It is an amenable number.
200230123031317 is a deficient number, since it is larger than the sum of its proper divisors (1).
200230123031317 is an equidigital number, since it uses as much as digits as its factorization.
200230123031317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 200230123031317 its reverse (713130321032002), we get a palindrome (913360444063319).
The spelling of 200230123031317 in words is "two hundred trillion, two hundred thirty billion, one hundred twenty-three million, thirty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •