Base | Representation |
---|---|
bin | 1011001010000… |
… | …1110010110101 |
3 | 10021001200121022 |
4 | 2302201302311 |
5 | 43440100203 |
6 | 4351030525 |
7 | 1105536206 |
oct | 262416265 |
9 | 107050538 |
10 | 46800053 |
11 | 24465633 |
12 | 1380b445 |
13 | 9907a51 |
14 | 63035ad |
15 | 4196a38 |
hex | 2ca1cb5 |
46800053 has 2 divisors, whose sum is σ = 46800054. Its totient is φ = 46800052.
The previous prime is 46800037. The next prime is 46800077. The reversal of 46800053 is 35000864.
46800053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41049649 + 5750404 = 6407^2 + 2398^2 .
It is a cyclic number.
It is not a de Polignac number, because 46800053 - 24 = 46800037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 46799995 and 46800031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46800023) 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, 23400026 + 23400027.
It is an arithmetic number, because the mean of its divisors is an integer number (23400027).
Almost surely, 246800053 is an apocalyptic number.
It is an amenable number.
46800053 is a deficient number, since it is larger than the sum of its proper divisors (1).
46800053 is an equidigital number, since it uses as much as digits as its factorization.
46800053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 46800053 is about 6841.0564242666. The cubic root of 46800053 is about 360.3701260200.
The spelling of 46800053 in words is "forty-six million, eight hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •