Base | Representation |
---|---|
bin | 11001100010010… |
… | …01111010001001 |
3 | 112221002002221102 |
4 | 30301021322021 |
5 | 414314242413 |
6 | 33131151145 |
7 | 5210526314 |
oct | 1461117211 |
9 | 487062842 |
10 | 214212233 |
11 | aaa0a904 |
12 | 5b8a54b5 |
13 | 354c2201 |
14 | 2064197b |
15 | 13c15458 |
hex | cc49e89 |
214212233 has 8 divisors (see below), whose sum is σ = 216672456. Its totient is φ = 211766400.
The previous prime is 214212227. The next prime is 214212247. The reversal of 214212233 is 332212412.
It can be written as a sum of positive squares in 4 ways, for example, as 37002889 + 177209344 = 6083^2 + 13312^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-214212233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214212533) 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 7 ways as a sum of consecutive naturals, for example, 27893 + ... + 34733.
It is an arithmetic number, because the mean of its divisors is an integer number (27084057).
Almost surely, 2214212233 is an apocalyptic number.
It is an amenable number.
214212233 is a deficient number, since it is larger than the sum of its proper divisors (2460223).
214212233 is a wasteful number, since it uses less digits than its factorization.
214212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7195.
The product of its digits is 576, while the sum is 20.
The square root of 214212233 is about 14635.9910153020. The cubic root of 214212233 is about 598.3400721527.
Adding to 214212233 its reverse (332212412), we get a palindrome (546424645).
The spelling of 214212233 in words is "two hundred fourteen million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •