Base | Representation |
---|---|
bin | 11001101000000… |
… | …10010001011001 |
3 | 112222111110211000 |
4 | 30310002101121 |
5 | 420012424020 |
6 | 33155255213 |
7 | 5220123033 |
oct | 1464022131 |
9 | 488443730 |
10 | 214967385 |
11 | 1003861a6 |
12 | 5bbaa509 |
13 | 356c7b49 |
14 | 2079ac53 |
15 | 13d14090 |
hex | cd02459 |
214967385 has 64 divisors (see below), whose sum is σ = 393465600. Its totient is φ = 111315456.
The previous prime is 214967381. The next prime is 214967399. The reversal of 214967385 is 583769412.
It is not a de Polignac number, because 214967385 - 22 = 214967381 is a prime.
It is a super-2 number, since 2×2149673852 = 92421953227476450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 214967385.
It is not an unprimeable number, because it can be changed into a prime (214967381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1091107 + ... + 1091303.
It is an arithmetic number, because the mean of its divisors is an integer number (6147900).
Almost surely, 2214967385 is an apocalyptic number.
It is an amenable number.
214967385 is a deficient number, since it is larger than the sum of its proper divisors (178498215).
214967385 is a wasteful number, since it uses less digits than its factorization.
214967385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407 (or 401 counting only the distinct ones).
The product of its digits is 362880, while the sum is 45.
The square root of 214967385 is about 14661.7660941648. The cubic root of 214967385 is about 599.0423473154.
The spelling of 214967385 in words is "two hundred fourteen million, nine hundred sixty-seven thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •