Base | Representation |
---|---|
bin | 1011001000010… |
… | …1001110101101 |
3 | 10020211202002222 |
4 | 2302011032231 |
5 | 43422324203 |
6 | 4344325125 |
7 | 1104541124 |
oct | 262051655 |
9 | 106752088 |
10 | 46683053 |
11 | 2439573a |
12 | 137737a5 |
13 | 9896711 |
14 | 62b2abb |
15 | 4172038 |
hex | 2c853ad |
46683053 has 2 divisors, whose sum is σ = 46683054. Its totient is φ = 46683052.
The previous prime is 46683047. The next prime is 46683059. The reversal of 46683053 is 35038664.
46683053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (46683047) and next prime (46683059).
It can be written as a sum of positive squares in only one way, i.e., 44129449 + 2553604 = 6643^2 + 1598^2 .
It is a cyclic number.
It is not a de Polignac number, because 46683053 - 222 = 42488749 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46683059) 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, 23341526 + 23341527.
It is an arithmetic number, because the mean of its divisors is an integer number (23341527).
Almost surely, 246683053 is an apocalyptic number.
It is an amenable number.
46683053 is a deficient number, since it is larger than the sum of its proper divisors (1).
46683053 is an equidigital number, since it uses as much as digits as its factorization.
46683053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 46683053 is about 6832.4997621661. The cubic root of 46683053 is about 360.0695673171.
The spelling of 46683053 in words is "forty-six million, six hundred eighty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •