Base | Representation |
---|---|
bin | 1100011101010111001… |
… | …0010011101101001111 |
3 | 202110110211021022102021 |
4 | 3013111302103231033 |
5 | 12001323233214211 |
6 | 242154554511011 |
7 | 21315054051466 |
oct | 3072562235517 |
9 | 673424238367 |
10 | 214040132431 |
11 | 82857090534 |
12 | 35595735467 |
13 | 1725103cc48 |
14 | a506a439dd |
15 | 587ad83771 |
hex | 31d5c93b4f |
214040132431 has 8 divisors (see below), whose sum is σ = 220950003200. Its totient is φ = 207130596120.
The previous prime is 214040132419. The next prime is 214040132447. The reversal of 214040132431 is 134231040412.
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 214040132431 - 211 = 214040130383 is a prime.
It is a super-2 number, since 2×2140401324312 (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 = 214040132396 and 214040132405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214040132401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2260600 + ... + 2353378.
It is an arithmetic number, because the mean of its divisors is an integer number (27618750400).
Almost surely, 2214040132431 is an apocalyptic number.
214040132431 is a deficient number, since it is larger than the sum of its proper divisors (6909870769).
214040132431 is an equidigital number, since it uses as much as digits as its factorization.
214040132431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167229.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 214040132431 its reverse (134231040412), we get a palindrome (348271172843).
The spelling of 214040132431 in words is "two hundred fourteen billion, forty million, one hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.038 sec. • engine limits •