Base | Representation |
---|---|
bin | 1100010111010101101… |
… | …0010100101000011111 |
3 | 202022022010210021001021 |
4 | 3011311122110220133 |
5 | 11440020321411111 |
6 | 241330315025011 |
7 | 21230021452243 |
oct | 3056532245037 |
9 | 668263707037 |
10 | 212423232031 |
11 | 820a741630a |
12 | 3520413b167 |
13 | 1705406a84a |
14 | a3d1dd0423 |
15 | 57d3e46d71 |
hex | 3175694a1f |
212423232031 has 4 divisors (see below), whose sum is σ = 221659024752. Its totient is φ = 203187439312.
The previous prime is 212423232011. The next prime is 212423232053. The reversal of 212423232031 is 130232324212.
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 212423232031 - 229 = 211886361119 is a prime.
It is a super-2 number, since 2×2124232320312 (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 = 212423231987 and 212423232005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212423232011) 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, 4617896326 + ... + 4617896371.
It is an arithmetic number, because the mean of its divisors is an integer number (55414756188).
Almost surely, 2212423232031 is an apocalyptic number.
212423232031 is a deficient number, since it is larger than the sum of its proper divisors (9235792721).
212423232031 is an equidigital number, since it uses as much as digits as its factorization.
212423232031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9235792720.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 212423232031 its reverse (130232324212), we get a palindrome (342655556243).
The spelling of 212423232031 in words is "two hundred twelve billion, four hundred twenty-three million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •