Base | Representation |
---|---|
bin | 1100011101010101101… |
… | …1101110100010111011 |
3 | 202110110102010120112222 |
4 | 3013111123232202323 |
5 | 12001320224304201 |
6 | 242154223554255 |
7 | 21314652536021 |
oct | 3072533564273 |
9 | 673412116488 |
10 | 214034213051 |
11 | 8285380818a |
12 | 3559375b98b |
13 | 1724ca49859 |
14 | a505d42711 |
15 | 587a5b491b |
hex | 31d56ee8bb |
214034213051 has 8 divisors (see below), whose sum is σ = 220606960608. Its totient is φ = 207560304000.
The previous prime is 214034213047. The next prime is 214034213089. The reversal of 214034213051 is 150312430412.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 214034213051 - 22 = 214034213047 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 214034213051.
It is not an unprimeable number, because it can be changed into a prime (214034213011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24705230 + ... + 24713891.
It is an arithmetic number, because the mean of its divisors is an integer number (27575870076).
Almost surely, 2214034213051 is an apocalyptic number.
214034213051 is a deficient number, since it is larger than the sum of its proper divisors (6572747557).
214034213051 is an equidigital number, since it uses as much as digits as its factorization.
214034213051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49419253.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 214034213051 its reverse (150312430412), we get a palindrome (364346643463).
The spelling of 214034213051 in words is "two hundred fourteen billion, thirty-four million, two hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •