Base | Representation |
---|---|
bin | 110000011110111011000010… |
… | …101010100000011101010000 |
3 | 1000221222201000210212101211120 |
4 | 300132323002222200131100 |
5 | 210422040010322100422 |
6 | 2033301022220042240 |
7 | 62625306135236556 |
oct | 6036730252403520 |
9 | 1027881023771746 |
10 | 213231212300112 |
11 | 61a3a938465296 |
12 | 1bab9779693380 |
13 | 91c980383b4a6 |
14 | 3a92635187bd6 |
15 | 199b976e3e45c |
hex | c1eec2aa0750 |
213231212300112 has 40 divisors (see below), whose sum is σ = 550860292625280. Its totient is φ = 71075394097920.
The previous prime is 213231212300111. The next prime is 213231212300159. The reversal of 213231212300112 is 211003212132312.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213231212300111) 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, 50339064 + ... + 54410327.
It is an arithmetic number, because the mean of its divisors is an integer number (13771507315632).
Almost surely, 2213231212300112 is an apocalyptic number.
It is an amenable number.
213231212300112 is an abundant number, since it is smaller than the sum of its proper divisors (337629080325168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213231212300112 is a wasteful number, since it uses less digits than its factorization.
213231212300112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104791811 (or 104791805 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 213231212300112 its reverse (211003212132312), we get a palindrome (424234424432424).
The spelling of 213231212300112 in words is "two hundred thirteen trillion, two hundred thirty-one billion, two hundred twelve million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •