Base | Representation |
---|---|
bin | 1001001001010001110100… |
… | …00011111110110101100101 |
3 | 2122012111110020120110020012 |
4 | 10210220322003332311211 |
5 | 10113440300304032323 |
6 | 110434224515420005 |
7 | 4143620551064516 |
oct | 444507203766545 |
9 | 78174406513205 |
10 | 20110011002213 |
11 | 6453675a42290 |
12 | 2309555bb4605 |
13 | b2b49ab63712 |
14 | 4d7488aa6a0d |
15 | 24d192e03678 |
hex | 124a3a0fed65 |
20110011002213 has 8 divisors (see below), whose sum is σ = 21938230042176. Its totient is φ = 18281797999200.
The previous prime is 20110011002183. The next prime is 20110011002233. The reversal of 20110011002213 is 31220011001102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20110011002213 - 26 = 20110011002149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110011002233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8135945 + ... + 10315697.
It is an arithmetic number, because the mean of its divisors is an integer number (2742278755272).
Almost surely, 220110011002213 is an apocalyptic number.
It is an amenable number.
20110011002213 is a deficient number, since it is larger than the sum of its proper divisors (1828219039963).
20110011002213 is a wasteful number, since it uses less digits than its factorization.
20110011002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3018475.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 20110011002213 its reverse (31220011001102), we get a palindrome (51330022003315).
The spelling of 20110011002213 in words is "twenty trillion, one hundred ten billion, eleven million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •