Base | Representation |
---|---|
bin | 1100010110111001000… |
… | …0011111001101110111 |
3 | 202021222202221200110221 |
4 | 3011232100133031313 |
5 | 11434244110312211 |
6 | 241310350355211 |
7 | 21224033352631 |
oct | 3055620371567 |
9 | 667882850427 |
10 | 212303213431 |
11 | 820456a1591 |
12 | 3518babbb07 |
13 | 1703523831a |
14 | a3c00aba51 |
15 | 57c863ac71 |
hex | 316e41f377 |
212303213431 has 8 divisors (see below), whose sum is σ = 221538399840. Its totient is φ = 203068411392.
The previous prime is 212303213417. The next prime is 212303213461. The reversal of 212303213431 is 134312303212.
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 212303213431 - 25 = 212303213399 is a prime.
It is a super-2 number, since 2×2123032134312 (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 = 212303213396 and 212303213405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212303213401) 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, 2138511 + ... + 2235583.
It is an arithmetic number, because the mean of its divisors is an integer number (27692299980).
Almost surely, 2212303213431 is an apocalyptic number.
212303213431 is a deficient number, since it is larger than the sum of its proper divisors (9235186409).
212303213431 is an equidigital number, since it uses as much as digits as its factorization.
212303213431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192185.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 212303213431 its reverse (134312303212), we get a palindrome (346615516643).
The spelling of 212303213431 in words is "two hundred twelve billion, three hundred three million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •