Base | Representation |
---|---|
bin | 1100011101101011000… |
… | …0000110111111010011 |
3 | 202110200122000212211201 |
4 | 3013122300012333103 |
5 | 12002011100122011 |
6 | 242211132252031 |
7 | 21320115141064 |
oct | 3073260067723 |
9 | 673618025751 |
10 | 214123442131 |
11 | 8289a112325 |
12 | 355b9611017 |
13 | 1726538b921 |
14 | a513b2c56b |
15 | 588333ccc1 |
hex | 31dac06fd3 |
214123442131 has 4 divisors (see below), whose sum is σ = 225393097000. Its totient is φ = 202853787264.
The previous prime is 214123442123. The next prime is 214123442161. The reversal of 214123442131 is 131244321412.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 214123442131 - 23 = 214123442123 is a prime.
It is a super-2 number, since 2×2141234421312 (a number of 23 digits) contains 22 as substring.
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 214123442131.
It is not an unprimeable number, because it can be changed into a prime (214123442161) 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, 5634827406 + ... + 5634827443.
It is an arithmetic number, because the mean of its divisors is an integer number (56348274250).
Almost surely, 2214123442131 is an apocalyptic number.
214123442131 is a deficient number, since it is larger than the sum of its proper divisors (11269654869).
214123442131 is a wasteful number, since it uses less digits than its factorization.
214123442131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11269654868.
The product of its digits is 4608, while the sum is 28.
Adding to 214123442131 its reverse (131244321412), we get a palindrome (345367763543).
The spelling of 214123442131 in words is "two hundred fourteen billion, one hundred twenty-three million, four hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •