Base | Representation |
---|---|
bin | 110111101101110110010010… |
… | …010100100010011011111101 |
3 | 1012010121220101121020201002122 |
4 | 313231312102110202123331 |
5 | 224104242010320334112 |
6 | 2225055145242332325 |
7 | 102420534345136136 |
oct | 6755662224423375 |
9 | 1163556347221078 |
10 | 245043223996157 |
11 | 7109527a755a54 |
12 | 23597027aba0a5 |
13 | a6966278c0c92 |
14 | 44722262c6c8d |
15 | 1d4e20b052872 |
hex | dedd925226fd |
245043223996157 has 2 divisors, whose sum is σ = 245043223996158. Its totient is φ = 245043223996156.
The previous prime is 245043223996019. The next prime is 245043223996163. The reversal of 245043223996157 is 751699322340542.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 228837655919161 + 16205568076996 = 15127381^2 + 4025614^2 .
It is a cyclic number.
It is not a de Polignac number, because 245043223996157 - 226 = 245043156887293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 245043223996157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (245043223993157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122521611998078 + 122521611998079.
It is an arithmetic number, because the mean of its divisors is an integer number (122521611998079).
Almost surely, 2245043223996157 is an apocalyptic number.
It is an amenable number.
245043223996157 is a deficient number, since it is larger than the sum of its proper divisors (1).
245043223996157 is an equidigital number, since it uses as much as digits as its factorization.
245043223996157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97977600, while the sum is 62.
The spelling of 245043223996157 in words is "two hundred forty-five trillion, forty-three billion, two hundred twenty-three million, nine hundred ninety-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •