Base | Representation |
---|---|
bin | 1100011010101011011… |
… | …1100111000010001111 |
3 | 202101121122101222101200 |
4 | 3012222313213002033 |
5 | 11443334421231111 |
6 | 241555314040543 |
7 | 21261161643501 |
oct | 3065267470217 |
9 | 671548358350 |
10 | 213320102031 |
11 | 825176aaa93 |
12 | 35414579153 |
13 | 17167b0965a |
14 | a479173d71 |
15 | 5837a56256 |
hex | 31aade708f |
213320102031 has 48 divisors (see below), whose sum is σ = 320252849280. Its totient is φ = 136712378880.
The previous prime is 213320102011. The next prime is 213320102057. The reversal of 213320102031 is 130201023312.
213320102031 is a `hidden beast` number, since 213 + 320 + 102 + 0 + 31 = 666.
It is not a de Polignac number, because 213320102031 - 25 = 213320101999 is a prime.
It is a super-2 number, since 2×2133201020312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213320101995 and 213320102013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213320102011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 70564186 + ... + 70567208.
It is an arithmetic number, because the mean of its divisors is an integer number (6671934360).
Almost surely, 2213320102031 is an apocalyptic number.
213320102031 is a deficient number, since it is larger than the sum of its proper divisors (106932747249).
213320102031 is a wasteful number, since it uses less digits than its factorization.
213320102031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5536 (or 5533 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 213320102031 its reverse (130201023312), we get a palindrome (343521125343).
The spelling of 213320102031 in words is "two hundred thirteen billion, three hundred twenty million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •