Base | Representation |
---|---|
bin | 1100011110000010010… |
… | …1000100111010010011 |
3 | 202110221110000011201021 |
4 | 3013200211010322103 |
5 | 12002211112311311 |
6 | 242224544020311 |
7 | 21322413161236 |
oct | 3074045047223 |
9 | 673843004637 |
10 | 214221213331 |
11 | 8293a321274 |
12 | 35626301697 |
13 | 1727c701ac8 |
14 | a522add41d |
15 | 588bc02171 |
hex | 31e0944e93 |
214221213331 has 16 divisors (see below), whose sum is σ = 237223641600. Its totient is φ = 192414423168.
The previous prime is 214221213307. The next prime is 214221213343. The reversal of 214221213331 is 133312122412.
It is a cyclic number.
It is not a de Polignac number, because 214221213331 - 25 = 214221213299 is a prime.
It is a super-2 number, since 2×2142212133312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 214221213296 and 214221213305.
It is not an unprimeable number, because it can be changed into a prime (214221213301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 452361 + ... + 795658.
It is an arithmetic number, because the mean of its divisors is an integer number (14826477600).
Almost surely, 2214221213331 is an apocalyptic number.
214221213331 is a deficient number, since it is larger than the sum of its proper divisors (23002428269).
214221213331 is a wasteful number, since it uses less digits than its factorization.
214221213331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248498.
The product of its digits is 1728, while the sum is 25.
Adding to 214221213331 its reverse (133312122412), we get a palindrome (347533335743).
The spelling of 214221213331 in words is "two hundred fourteen billion, two hundred twenty-one million, two hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •