Base | Representation |
---|---|
bin | 1100011001110111010… |
… | …1000100001100011111 |
3 | 202101001101202021021110 |
4 | 3012131311010030133 |
5 | 11442412420044411 |
6 | 241521501033103 |
7 | 21252564266655 |
oct | 3063565041437 |
9 | 671041667243 |
10 | 213101331231 |
11 | 82415167278 |
12 | 35373255793 |
13 | 171316ac589 |
14 | a4580a6dd5 |
15 | 58237402a6 |
hex | 319dd4431f |
213101331231 has 8 divisors (see below), whose sum is σ = 284145093040. Its totient is φ = 142062561792.
The previous prime is 213101331229. The next prime is 213101331307. The reversal of 213101331231 is 132133101312.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213101331231 - 21 = 213101331229 is a prime.
It is a super-2 number, since 2×2131013312312 (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 = 213101331198 and 213101331207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213101331211) 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, 1147330 + ... + 1320063.
It is an arithmetic number, because the mean of its divisors is an integer number (35518136630).
Almost surely, 2213101331231 is an apocalyptic number.
213101331231 is a deficient number, since it is larger than the sum of its proper divisors (71043761809).
213101331231 is a wasteful number, since it uses less digits than its factorization.
213101331231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2496185.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 213101331231 its reverse (132133101312), we get a palindrome (345234432543).
The spelling of 213101331231 in words is "two hundred thirteen billion, one hundred one million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •