Base | Representation |
---|---|
bin | 1110100010011001100… |
… | …1000101101000110111 |
3 | 212212122122212000201122 |
4 | 3220212121011220313 |
5 | 13042443031322241 |
6 | 310422400414155 |
7 | 24021043535543 |
oct | 3504631055067 |
9 | 785578760648 |
10 | 249752214071 |
11 | 96a12682a98 |
12 | 404a161735b |
13 | 1a7229431b9 |
14 | c133950a23 |
15 | 676b1c104b |
hex | 3a26645a37 |
249752214071 has 2 divisors, whose sum is σ = 249752214072. Its totient is φ = 249752214070.
The previous prime is 249752214037. The next prime is 249752214073. The reversal of 249752214071 is 170412257942.
249752214071 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 249752214071 - 210 = 249752213047 is a prime.
It is a super-2 number, since 2×2497522140712 (a number of 24 digits) contains 22 as substring.
Together with 249752214073, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (249752214073) 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, 124876107035 + 124876107036.
It is an arithmetic number, because the mean of its divisors is an integer number (124876107036).
Almost surely, 2249752214071 is an apocalyptic number.
249752214071 is a deficient number, since it is larger than the sum of its proper divisors (1).
249752214071 is an equidigital number, since it uses as much as digits as its factorization.
249752214071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 282240, while the sum is 44.
The spelling of 249752214071 in words is "two hundred forty-nine billion, seven hundred fifty-two million, two hundred fourteen thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •