Base | Representation |
---|---|
bin | 101011010100011111… |
… | …001010001101101001 |
3 | 11110001200110001211012 |
4 | 223110133022031221 |
5 | 1230230220023144 |
6 | 33211333313305 |
7 | 3234450445634 |
oct | 532437121551 |
9 | 143050401735 |
10 | 46514611049 |
11 | 187aa315815 |
12 | 9021795835 |
13 | 450394a9ba |
14 | 2373896c1b |
15 | 13238c1e9e |
hex | ad47ca369 |
46514611049 has 2 divisors, whose sum is σ = 46514611050. Its totient is φ = 46514611048.
The previous prime is 46514611043. The next prime is 46514611051. The reversal of 46514611049 is 94011641564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34582981225 + 11931629824 = 185965^2 + 109232^2 .
It is a cyclic number.
It is not a de Polignac number, because 46514611049 - 228 = 46246175593 is a prime.
Together with 46514611051, 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 = 46514610997 and 46514611015.
It is not a weakly prime, because it can be changed into another prime (46514611043) 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, 23257305524 + 23257305525.
It is an arithmetic number, because the mean of its divisors is an integer number (23257305525).
Almost surely, 246514611049 is an apocalyptic number.
It is an amenable number.
46514611049 is a deficient number, since it is larger than the sum of its proper divisors (1).
46514611049 is an equidigital number, since it uses as much as digits as its factorization.
46514611049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 46514611049 in words is "forty-six billion, five hundred fourteen million, six hundred eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •