Base | Representation |
---|---|
bin | 100100000011… |
… | …1111110101101 |
3 | 1022120120121020 |
4 | 1020013332231 |
5 | 14320011203 |
6 | 1513124353 |
7 | 316464414 |
oct | 110077655 |
9 | 38516536 |
10 | 18907053 |
11 | a744170 |
12 | 63b96b9 |
13 | 3bbcb09 |
14 | 272247b |
15 | 19d7153 |
hex | 1207fad |
18907053 has 8 divisors (see below), whose sum is σ = 27501216. Its totient is φ = 11458800.
The previous prime is 18907013. The next prime is 18907067. The reversal of 18907053 is 35070981.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 18907053 - 213 = 18898861 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 572941 = 18907053 / (1 + 8 + 9 + 0 + 7 + 0 + 5 + 3).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18907013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286438 + ... + 286503.
It is an arithmetic number, because the mean of its divisors is an integer number (3437652).
Almost surely, 218907053 is an apocalyptic number.
It is an amenable number.
18907053 is a deficient number, since it is larger than the sum of its proper divisors (8594163).
18907053 is a wasteful number, since it uses less digits than its factorization.
18907053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 572955.
The product of its (nonzero) digits is 7560, while the sum is 33.
The square root of 18907053 is about 4348.2241202588. The cubic root of 18907053 is about 266.4043307244.
The spelling of 18907053 in words is "eighteen million, nine hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •