Base | Representation |
---|---|
bin | 11001100110011… |
… | …00110010101001 |
3 | 112222002100022211 |
4 | 30303030302221 |
5 | 414433421304 |
6 | 33150445121 |
7 | 5215221265 |
oct | 1463146251 |
9 | 488070284 |
10 | 214748329 |
11 | 100246664 |
12 | 5bb037a1 |
13 | 3564c223 |
14 | 207410a5 |
15 | 13cbe204 |
hex | ccccca9 |
214748329 has 2 divisors, whose sum is σ = 214748330. Its totient is φ = 214748328.
The previous prime is 214748297. The next prime is 214748341. The reversal of 214748329 is 923847412.
214748329 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142157929 + 72590400 = 11923^2 + 8520^2 .
It is a cyclic number.
It is not a de Polignac number, because 214748329 - 25 = 214748297 is a prime.
It is a super-2 number, since 2×2147483292 = 92233689616584482, which contains 22 as substring.
It is a nialpdrome in base 16.
It is a junction number, because it is equal to n+sod(n) for n = 214748291 and 214748300.
It is not a weakly prime, because it can be changed into another prime (214748389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107374164 + 107374165.
It is an arithmetic number, because the mean of its divisors is an integer number (107374165).
Almost surely, 2214748329 is an apocalyptic number.
It is an amenable number.
214748329 is a deficient number, since it is larger than the sum of its proper divisors (1).
214748329 is an equidigital number, since it uses as much as digits as its factorization.
214748329 is an evil number, because the sum of its binary digits is even.
The product of its digits is 96768, while the sum is 40.
The square root of 214748329 is about 14654.2938758577. The cubic root of 214748329 is about 598.8387995092.
The spelling of 214748329 in words is "two hundred fourteen million, seven hundred forty-eight thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •