Base | Representation |
---|---|
bin | 1100011101100101110… |
… | …0000111100110010101 |
3 | 202110122002121021101010 |
4 | 3013121130013212111 |
5 | 12001434431041113 |
6 | 242205024322433 |
7 | 21316430036613 |
oct | 3073134074625 |
9 | 673562537333 |
10 | 214101424533 |
11 | 82888744167 |
12 | 355b2173419 |
13 | 17260950069 |
14 | a510c3a6b3 |
15 | 588143e1c3 |
hex | 31d9707995 |
214101424533 has 4 divisors (see below), whose sum is σ = 285468566048. Its totient is φ = 142734283020.
The previous prime is 214101424447. The next prime is 214101424541. The reversal of 214101424533 is 335424101412.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 214101424533 - 214 = 214101408149 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 214101424533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214101424553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35683570753 + ... + 35683570758.
It is an arithmetic number, because the mean of its divisors is an integer number (71367141512).
Almost surely, 2214101424533 is an apocalyptic number.
It is an amenable number.
214101424533 is a deficient number, since it is larger than the sum of its proper divisors (71367141515).
214101424533 is an equidigital number, since it uses as much as digits as its factorization.
214101424533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71367141514.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 214101424533 its reverse (335424101412), we get a palindrome (549525525945).
The spelling of 214101424533 in words is "two hundred fourteen billion, one hundred one million, four hundred twenty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •