Base | Representation |
---|---|
bin | 1100101111111… |
… | …0010111001011 |
3 | 10201121120222002 |
4 | 3023332113023 |
5 | 102142030132 |
6 | 5150021215 |
7 | 1216331105 |
oct | 313762713 |
9 | 121546862 |
10 | 53470667 |
11 | 28201338 |
12 | 15aa780b |
13 | b102063 |
14 | 715c575 |
15 | 4a63262 |
hex | 32fe5cb |
53470667 has 4 divisors (see below), whose sum is σ = 53779920. Its totient is φ = 53161416.
The previous prime is 53470657. The next prime is 53470673. The reversal of 53470667 is 76607435.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76607435 = 5 ⋅15321487.
It is a cyclic number.
It is not a de Polignac number, because 53470667 - 26 = 53470603 is a prime.
It is a super-2 number, since 2×534706672 = 5718224458849778, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53470667.
It is not an unprimeable number, because it can be changed into a prime (53470657) 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 3 ways as a sum of consecutive naturals, for example, 154367 + ... + 154712.
It is an arithmetic number, because the mean of its divisors is an integer number (13444980).
Almost surely, 253470667 is an apocalyptic number.
53470667 is a deficient number, since it is larger than the sum of its proper divisors (309253).
53470667 is a wasteful number, since it uses less digits than its factorization.
53470667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309252.
The product of its (nonzero) digits is 105840, while the sum is 38.
The square root of 53470667 is about 7312.3639816410. The cubic root of 53470667 is about 376.7372244498.
The spelling of 53470667 in words is "fifty-three million, four hundred seventy thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •