Base | Representation |
---|---|
bin | 1110010001010001001… |
… | …0100011001111100111 |
3 | 212102210011122100011011 |
4 | 3210110102203033213 |
5 | 13004033301340033 |
6 | 304342203123051 |
7 | 23466063506635 |
oct | 3442422431747 |
9 | 772704570134 |
10 | 245153543143 |
11 | 94a72869503 |
12 | 3b619513487 |
13 | 1a16bc9cb42 |
14 | bc18cbc355 |
15 | 659c5e1ccd |
hex | 39144a33e7 |
245153543143 has 2 divisors, whose sum is σ = 245153543144. Its totient is φ = 245153543142.
The previous prime is 245153543111. The next prime is 245153543147. The reversal of 245153543143 is 341345351542.
245153543143 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 245153543143 - 25 = 245153543111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 245153543096 and 245153543105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (245153543147) 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, 122576771571 + 122576771572.
It is an arithmetic number, because the mean of its divisors is an integer number (122576771572).
Almost surely, 2245153543143 is an apocalyptic number.
245153543143 is a deficient number, since it is larger than the sum of its proper divisors (1).
245153543143 is an equidigital number, since it uses as much as digits as its factorization.
245153543143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432000, while the sum is 40.
Adding to 245153543143 its reverse (341345351542), we get a palindrome (586498894685).
The spelling of 245153543143 in words is "two hundred forty-five billion, one hundred fifty-three million, five hundred forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •