Base | Representation |
---|---|
bin | 1100011101010010101… |
… | …0001000010001010111 |
3 | 202110102111200000101210 |
4 | 3013110222020101113 |
5 | 12001303412224343 |
6 | 242153041152503 |
7 | 21314434164561 |
oct | 3072452102127 |
9 | 673374600353 |
10 | 214021211223 |
11 | 82847437776 |
12 | 3558b32b733 |
13 | 1724a146871 |
14 | a50431a331 |
15 | 5879397333 |
hex | 31d4a88457 |
214021211223 has 8 divisors (see below), whose sum is σ = 285370735600. Its totient is φ = 142676247168.
The previous prime is 214021211191. The next prime is 214021211227. The reversal of 214021211223 is 322112120412.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 214021211223 - 25 = 214021211191 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 214021211223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214021211227) 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 7 ways as a sum of consecutive naturals, for example, 1029028 + ... + 1219401.
It is an arithmetic number, because the mean of its divisors is an integer number (35671341950).
Almost surely, 2214021211223 is an apocalyptic number.
214021211223 is a deficient number, since it is larger than the sum of its proper divisors (71349524377).
214021211223 is a wasteful number, since it uses less digits than its factorization.
214021211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2280161.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 214021211223 its reverse (322112120412), we get a palindrome (536133331635).
The spelling of 214021211223 in words is "two hundred fourteen billion, twenty-one million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •