Base | Representation |
---|---|
bin | 110000011011110000000001… |
… | …111110111111100101100011 |
3 | 1000221012212101100011102101120 |
4 | 300123300001332333211203 |
5 | 210410002044203144021 |
6 | 2033012532202503323 |
7 | 62603461306314516 |
oct | 6033600176774543 |
9 | 1027185340142346 |
10 | 213013231303011 |
11 | 61966449910907 |
12 | 1ba83484204b43 |
13 | 91b20a5213379 |
14 | 3a85c76dc4d7d |
15 | 1995e6a1172c6 |
hex | c1bc01fbf963 |
213013231303011 has 4 divisors (see below), whose sum is σ = 284017641737352. Its totient is φ = 142008820868672.
The previous prime is 213013231302961. The next prime is 213013231303039. The reversal of 213013231303011 is 110303132310312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213013231303011 - 210 = 213013231301987 is a prime.
It is a super-2 number, since 2×2130132313030112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (213013231305011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35502205217166 + ... + 35502205217171.
It is an arithmetic number, because the mean of its divisors is an integer number (71004410434338).
Almost surely, 2213013231303011 is an apocalyptic number.
213013231303011 is a deficient number, since it is larger than the sum of its proper divisors (71004410434341).
213013231303011 is an equidigital number, since it uses as much as digits as its factorization.
213013231303011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71004410434340.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 213013231303011 its reverse (110303132310312), we get a palindrome (323316363613323).
The spelling of 213013231303011 in words is "two hundred thirteen trillion, thirteen billion, two hundred thirty-one million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •