Base | Representation |
---|---|
bin | 11001011110110… |
… | …011000110110101 |
3 | 1002210102110022110 |
4 | 121132303012311 |
5 | 1333420112203 |
6 | 110230521233 |
7 | 13410503334 |
oct | 3136630665 |
9 | 1083373273 |
10 | 427504053 |
11 | 1aa351139 |
12 | bb206219 |
13 | 6a7514a2 |
14 | 40ac3d1b |
15 | 277e7d03 |
hex | 197b31b5 |
427504053 has 8 divisors (see below), whose sum is σ = 570897216. Its totient is φ = 284556800.
The previous prime is 427504037. The next prime is 427504061. The reversal of 427504053 is 350405724.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 427504053 - 24 = 427504037 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 427504053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427504093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109233 + ... + 113078.
It is an arithmetic number, because the mean of its divisors is an integer number (71362152).
Almost surely, 2427504053 is an apocalyptic number.
It is an amenable number.
427504053 is a deficient number, since it is larger than the sum of its proper divisors (143393163).
427504053 is a wasteful number, since it uses less digits than its factorization.
427504053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222955.
The product of its (nonzero) digits is 16800, while the sum is 30.
The square root of 427504053 is about 20676.1711397444. The cubic root of 427504053 is about 753.3210079474.
Adding to 427504053 its reverse (350405724), we get a palindrome (777909777).
The spelling of 427504053 in words is "four hundred twenty-seven million, five hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •