Base | Representation |
---|---|
bin | 1110010001000111110… |
… | …1000011101000110011 |
3 | 212102200102220100001211 |
4 | 3210101331003220303 |
5 | 13003443233313402 |
6 | 304334243140551 |
7 | 23465106430351 |
oct | 3442175035063 |
9 | 772612810054 |
10 | 245114354227 |
11 | 94a52732276 |
12 | 3b608374757 |
13 | 1a163b2b532 |
14 | bc139da7d1 |
15 | 6598e504d7 |
hex | 3911f43a33 |
245114354227 has 2 divisors, whose sum is σ = 245114354228. Its totient is φ = 245114354226.
The previous prime is 245114354209. The next prime is 245114354257. The reversal of 245114354227 is 722453411542.
245114354227 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 245114354227 - 27 = 245114354099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 245114354227.
It is not a weakly prime, because it can be changed into another prime (245114354257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122557177113 + 122557177114.
It is an arithmetic number, because the mean of its divisors is an integer number (122557177114).
Almost surely, 2245114354227 is an apocalyptic number.
245114354227 is a deficient number, since it is larger than the sum of its proper divisors (1).
245114354227 is an equidigital number, since it uses as much as digits as its factorization.
245114354227 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 268800, while the sum is 40.
Adding to 245114354227 its reverse (722453411542), we get a palindrome (967567765769).
The spelling of 245114354227 in words is "two hundred forty-five billion, one hundred fourteen million, three hundred fifty-four thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •