Base | Representation |
---|---|
bin | 1110010011000100001… |
… | …1001011000111100111 |
3 | 212111000210120022002111 |
4 | 3210301003023013213 |
5 | 13011030312121211 |
6 | 304502121021451 |
7 | 23514042662431 |
oct | 3446103130747 |
9 | 774023508074 |
10 | 245636051431 |
11 | 951a0169091 |
12 | 3b733024887 |
13 | 1a217c3c3c4 |
14 | bc62ddd651 |
15 | 65c9b52421 |
hex | 39310cb1e7 |
245636051431 has 2 divisors, whose sum is σ = 245636051432. Its totient is φ = 245636051430.
The previous prime is 245636051359. The next prime is 245636051447. The reversal of 245636051431 is 134150636542.
245636051431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 245636051431 - 213 = 245636043239 is a prime.
It is a super-2 number, since 2×2456360514312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (245636051231) 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, 122818025715 + 122818025716.
It is an arithmetic number, because the mean of its divisors is an integer number (122818025716).
Almost surely, 2245636051431 is an apocalyptic number.
245636051431 is a deficient number, since it is larger than the sum of its proper divisors (1).
245636051431 is an equidigital number, since it uses as much as digits as its factorization.
245636051431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 245636051431 its reverse (134150636542), we get a palindrome (379786687973).
The spelling of 245636051431 in words is "two hundred forty-five billion, six hundred thirty-six million, fifty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •