Base | Representation |
---|---|
bin | 110000011011100100101010… |
… | …001101010000110000100001 |
3 | 1000221011200212101202110012102 |
4 | 300123210222031100300201 |
5 | 210404302042413330423 |
6 | 2033003152430340145 |
7 | 62602546604361404 |
oct | 6033445215206041 |
9 | 1027150771673172 |
10 | 213001021230113 |
11 | 61961253617376 |
12 | 1ba8103705a655 |
13 | 91b0baa6a876c |
14 | 3a85439521d3b |
15 | 19959a31ecc28 |
hex | c1b92a350c21 |
213001021230113 has 16 divisors (see below), whose sum is σ = 218699901649152. Its totient is φ = 207364703520000.
The previous prime is 213001021230103. The next prime is 213001021230163. The reversal of 213001021230113 is 311032120100312.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213001021230113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213001021230103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63568313 + ... + 66835113.
It is an arithmetic number, because the mean of its divisors is an integer number (13668743853072).
Almost surely, 2213001021230113 is an apocalyptic number.
It is an amenable number.
213001021230113 is a deficient number, since it is larger than the sum of its proper divisors (5698880419039).
213001021230113 is a wasteful number, since it uses less digits than its factorization.
213001021230113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276376.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 213001021230113 its reverse (311032120100312), we get a palindrome (524033141330425).
The spelling of 213001021230113 in words is "two hundred thirteen trillion, one billion, twenty-one million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •