Base | Representation |
---|---|
bin | 110111101101100010110100… |
… | …111101000101011100001101 |
3 | 1012010112220110110220121102212 |
4 | 313231202310331011130031 |
5 | 224103421213013323112 |
6 | 2225041412104200205 |
7 | 102416164521001616 |
oct | 6755426475053415 |
9 | 1163486413817385 |
10 | 245022330214157 |
11 | 71087428761321 |
12 | 23592b76769065 |
13 | a694677cb8c72 |
14 | 4471203422c0d |
15 | 1d4d8d6ad7522 |
hex | ded8b4f4570d |
245022330214157 has 2 divisors, whose sum is σ = 245022330214158. Its totient is φ = 245022330214156.
The previous prime is 245022330214121. The next prime is 245022330214169. The reversal of 245022330214157 is 751412033220542.
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., 218126344348201 + 26895985865956 = 14769101^2 + 5186134^2 .
It is a cyclic number.
It is not a de Polignac number, because 245022330214157 - 214 = 245022330197773 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (245022330214177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122511165107078 + 122511165107079.
It is an arithmetic number, because the mean of its divisors is an integer number (122511165107079).
Almost surely, 2245022330214157 is an apocalyptic number.
It is an amenable number.
245022330214157 is a deficient number, since it is larger than the sum of its proper divisors (1).
245022330214157 is an equidigital number, since it uses as much as digits as its factorization.
245022330214157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 41.
Adding to 245022330214157 its reverse (751412033220542), we get a palindrome (996434363434699).
The spelling of 245022330214157 in words is "two hundred forty-five trillion, twenty-two billion, three hundred thirty million, two hundred fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •