Base | Representation |
---|---|
bin | 11001100001001… |
… | …11000001001001 |
3 | 112220210211220101 |
4 | 30300213001021 |
5 | 414300204241 |
6 | 33124125401 |
7 | 5206362544 |
oct | 1460470111 |
9 | 486724811 |
10 | 214069321 |
11 | aa9224a4 |
12 | 5b836861 |
13 | 3547214b |
14 | 2060585b |
15 | 13bd7e31 |
hex | cc27049 |
214069321 has 4 divisors (see below), whose sum is σ = 226661652. Its totient is φ = 201476992.
The previous prime is 214069319. The next prime is 214069337. The reversal of 214069321 is 123960412.
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 190440000 + 23629321 = 13800^2 + 4861^2 .
It is a cyclic number.
It is not a de Polignac number, because 214069321 - 21 = 214069319 is a prime.
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 214069321.
It is not an unprimeable number, because it can be changed into a prime (214069301) 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 3 ways as a sum of consecutive naturals, for example, 6296140 + ... + 6296173.
It is an arithmetic number, because the mean of its divisors is an integer number (56665413).
Almost surely, 2214069321 is an apocalyptic number.
It is an amenable number.
214069321 is a deficient number, since it is larger than the sum of its proper divisors (12592331).
214069321 is a wasteful number, since it uses less digits than its factorization.
214069321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12592330.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 214069321 is about 14631.1079894860. The cubic root of 214069321 is about 598.2069814039.
The spelling of 214069321 in words is "two hundred fourteen million, sixty-nine thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •