Base | Representation |
---|---|
bin | 1011001000011… |
… | …1000101101101 |
3 | 10020212010120001 |
4 | 2302013011231 |
5 | 43423100134 |
6 | 4344424301 |
7 | 1104602254 |
oct | 262070555 |
9 | 106763501 |
10 | 46690669 |
11 | 243a0433 |
12 | 13778091 |
13 | 989a01c |
14 | 62b579b |
15 | 4174414 |
hex | 2c8716d |
46690669 has 2 divisors, whose sum is σ = 46690670. Its totient is φ = 46690668.
The previous prime is 46690607. The next prime is 46690691. The reversal of 46690669 is 96609664.
46690669 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., 45765225 + 925444 = 6765^2 + 962^2 .
It is a cyclic number.
It is not a de Polignac number, because 46690669 - 29 = 46690157 is a prime.
It is a super-2 number, since 2×466906692 = 4360037143335122, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46690169) 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, 23345334 + 23345335.
It is an arithmetic number, because the mean of its divisors is an integer number (23345335).
Almost surely, 246690669 is an apocalyptic number.
It is an amenable number.
46690669 is a deficient number, since it is larger than the sum of its proper divisors (1).
46690669 is an equidigital number, since it uses as much as digits as its factorization.
46690669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 419904, while the sum is 46.
The square root of 46690669 is about 6833.0570757165. The cubic root of 46690669 is about 360.0891471613.
The spelling of 46690669 in words is "forty-six million, six hundred ninety thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •