Base | Representation |
---|---|
bin | 101100100111101001… |
… | …111000100010001101 |
3 | 11120122220222200011102 |
4 | 230213221320202031 |
5 | 1241104420244044 |
6 | 34002020032445 |
7 | 3314152460363 |
oct | 544751704215 |
9 | 146586880142 |
10 | 47909931149 |
11 | 193559a8423 |
12 | 9350b32725 |
13 | 4696a4b2b2 |
14 | 2466d0b633 |
15 | 13a614024e |
hex | b27a7888d |
47909931149 has 2 divisors, whose sum is σ = 47909931150. Its totient is φ = 47909931148.
The previous prime is 47909931079. The next prime is 47909931151. The reversal of 47909931149 is 94113990974.
47909931149 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 can be written as a sum of positive squares in only one way, i.e., 47473873225 + 436057924 = 217885^2 + 20882^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47909931149 is a prime.
Together with 47909931151, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 47909931094 and 47909931103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47909931449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23954965574 + 23954965575.
It is an arithmetic number, because the mean of its divisors is an integer number (23954965575).
Almost surely, 247909931149 is an apocalyptic number.
It is an amenable number.
47909931149 is a deficient number, since it is larger than the sum of its proper divisors (1).
47909931149 is an equidigital number, since it uses as much as digits as its factorization.
47909931149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2204496, while the sum is 56.
The spelling of 47909931149 in words is "forty-seven billion, nine hundred nine million, nine hundred thirty-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •