Base | Representation |
---|---|
bin | 1100011010011000111… |
… | …0111001110111111111 |
3 | 202101102020001100211202 |
4 | 3012212032321313333 |
5 | 11443210013304211 |
6 | 241543455010115 |
7 | 21256225556015 |
oct | 3064616716777 |
9 | 671366040752 |
10 | 213242322431 |
11 | 82487806026 |
12 | 353b250993b |
13 | 17154975b18 |
14 | a46cac88b5 |
15 | 5830ce053b |
hex | 31a63b9dff |
213242322431 has 4 divisors (see below), whose sum is σ = 213661266600. Its totient is φ = 212823378264.
The previous prime is 213242322367. The next prime is 213242322437. The reversal of 213242322431 is 134223242312.
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 213242322431 - 26 = 213242322367 is a prime.
It is a super-2 number, since 2×2132423224312 (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 = 213242322394 and 213242322403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213242322437) 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, 209471321 + ... + 209472338.
It is an arithmetic number, because the mean of its divisors is an integer number (53415316650).
Almost surely, 2213242322431 is an apocalyptic number.
213242322431 is a deficient number, since it is larger than the sum of its proper divisors (418944169).
213242322431 is an equidigital number, since it uses as much as digits as its factorization.
213242322431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418944168.
The product of its digits is 13824, while the sum is 29.
Adding to 213242322431 its reverse (134223242312), we get a palindrome (347465564743).
The spelling of 213242322431 in words is "two hundred thirteen billion, two hundred forty-two million, three hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •