Base | Representation |
---|---|
bin | 1011001100110… |
… | …1101001001001 |
3 | 10021101210222022 |
4 | 2303031221021 |
5 | 44011322112 |
6 | 4354534225 |
7 | 1110214634 |
oct | 263155111 |
9 | 107353868 |
10 | 46979657 |
11 | 2457856a |
12 | 13897375 |
13 | 996b71a |
14 | 634cc1b |
15 | 41ced72 |
hex | 2ccda49 |
46979657 has 2 divisors, whose sum is σ = 46979658. Its totient is φ = 46979656.
The previous prime is 46979651. The next prime is 46979659. The reversal of 46979657 is 75697964.
46979657 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., 44342281 + 2637376 = 6659^2 + 1624^2 .
It is a cyclic number.
It is not a de Polignac number, because 46979657 - 212 = 46975561 is a prime.
Together with 46979659, 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 = 46979599 and 46979608.
It is not a weakly prime, because it can be changed into another prime (46979651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23489828 + 23489829.
It is an arithmetic number, because the mean of its divisors is an integer number (23489829).
Almost surely, 246979657 is an apocalyptic number.
It is an amenable number.
46979657 is a deficient number, since it is larger than the sum of its proper divisors (1).
46979657 is an equidigital number, since it uses as much as digits as its factorization.
46979657 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2857680, while the sum is 53.
The square root of 46979657 is about 6854.1707740616. The cubic root of 46979657 is about 360.8305335859.
The spelling of 46979657 in words is "forty-six million, nine hundred seventy-nine thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •