Base | Representation |
---|---|
bin | 110000011111111110000000… |
… | …101100101110110100100101 |
3 | 1000222020120122011221121112012 |
4 | 300133332000230232310211 |
5 | 210424224242211443023 |
6 | 2033354033420204005 |
7 | 62633433105665105 |
oct | 6037760054566445 |
9 | 1028216564847465 |
10 | 213303120031013 |
11 | 61a68388502871 |
12 | 1bb0b6a7399605 |
13 | 920352329549c |
14 | 3a95cd72bb205 |
15 | 199d784c88978 |
hex | c1ff80b2ed25 |
213303120031013 has 32 divisors (see below), whose sum is σ = 221564221132800. Its totient is φ = 205227105039936.
The previous prime is 213303120030997. The next prime is 213303120031021. The reversal of 213303120031013 is 310130021303312.
It is a cyclic number.
It is not a de Polignac number, because 213303120031013 - 24 = 213303120030997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213303120031013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213303120033013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9880165223 + ... + 9880186811.
It is an arithmetic number, because the mean of its divisors is an integer number (6923881910400).
Almost surely, 2213303120031013 is an apocalyptic number.
It is an amenable number.
213303120031013 is a deficient number, since it is larger than the sum of its proper divisors (8261101101787).
213303120031013 is a wasteful number, since it uses less digits than its factorization.
213303120031013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36561.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 213303120031013 its reverse (310130021303312), we get a palindrome (523433141334325).
The spelling of 213303120031013 in words is "two hundred thirteen trillion, three hundred three billion, one hundred twenty million, thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •