Base | Representation |
---|---|
bin | 101011010011000011… |
… | …000110001001011101 |
3 | 11110000000000221100001 |
4 | 223103003012021131 |
5 | 1230203030232044 |
6 | 33205112134301 |
7 | 3234035351464 |
oct | 532303061135 |
9 | 143000027301 |
10 | 46490477149 |
11 | 18797731646 |
12 | 9015697391 |
13 | 44cb94aa9c |
14 | 23705b39db |
15 | 13217062d4 |
hex | ad30c625d |
46490477149 has 2 divisors, whose sum is σ = 46490477150. Its totient is φ = 46490477148.
The previous prime is 46490477087. The next prime is 46490477191. The reversal of 46490477149 is 94177409464.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37019684025 + 9470793124 = 192405^2 + 97318^2 .
It is a cyclic number.
It is not a de Polignac number, because 46490477149 - 227 = 46356259421 is a prime.
It is a super-2 number, since 2×464904771492 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 46490477149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46490477249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23245238574 + 23245238575.
It is an arithmetic number, because the mean of its divisors is an integer number (23245238575).
Almost surely, 246490477149 is an apocalyptic number.
It is an amenable number.
46490477149 is a deficient number, since it is larger than the sum of its proper divisors (1).
46490477149 is an equidigital number, since it uses as much as digits as its factorization.
46490477149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6096384, while the sum is 55.
The spelling of 46490477149 in words is "forty-six billion, four hundred ninety million, four hundred seventy-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •