Base | Representation |
---|---|
bin | 11001100101000… |
… | …00010001111101 |
3 | 112221202002020101 |
4 | 30302200101331 |
5 | 414412103023 |
6 | 33142521101 |
7 | 5213531614 |
oct | 1462402175 |
9 | 487662211 |
10 | 214566013 |
11 | 100131692 |
12 | 5ba36191 |
13 | 355b724c |
14 | 206d487b |
15 | 13c851ad |
hex | cca047d |
214566013 has 4 divisors (see below), whose sum is σ = 215677948. Its totient is φ = 213454080.
The previous prime is 214566007. The next prime is 214566049. The reversal of 214566013 is 310665412.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 115304644 + 99261369 = 10738^2 + 9963^2 .
It is a cyclic number.
It is not a de Polignac number, because 214566013 - 225 = 181011581 is a prime.
It is a super-3 number, since 3×2145660133 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214566083) 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 in 3 ways as a sum of consecutive naturals, for example, 555678 + ... + 556063.
It is an arithmetic number, because the mean of its divisors is an integer number (53919487).
Almost surely, 2214566013 is an apocalyptic number.
It is an amenable number.
214566013 is a deficient number, since it is larger than the sum of its proper divisors (1111935).
214566013 is a wasteful number, since it uses less digits than its factorization.
214566013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111934.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 214566013 is about 14648.0719891732. The cubic root of 214566013 is about 598.6692851043.
The spelling of 214566013 in words is "two hundred fourteen million, five hundred sixty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •