Base | Representation |
---|---|
bin | 1010000111110111010011… |
… | …1100001110110010100101 |
3 | 1110102001001022201101001010 |
4 | 2201331310330032302211 |
5 | 2424324143341211323 |
6 | 35401053053252433 |
7 | 2226063165541011 |
oct | 241756474166245 |
9 | 43361038641033 |
10 | 11130222210213 |
11 | 3601334300947 |
12 | 12b9140a94119 |
13 | 62976335b302 |
14 | 2a69c4365541 |
15 | 1447c8cb2c93 |
hex | a1f74f0eca5 |
11130222210213 has 8 divisors (see below), whose sum is σ = 14843697695008. Its totient is φ = 7418447432784.
The previous prime is 11130222210169. The next prime is 11130222210251. The reversal of 11130222210213 is 31201222203111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11130222210213 - 28 = 11130222209957 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 11130222210213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130222210713) 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, 425161570 + ... + 425187747.
It is an arithmetic number, because the mean of its divisors is an integer number (1855462211876).
Almost surely, 211130222210213 is an apocalyptic number.
It is an amenable number.
11130222210213 is a deficient number, since it is larger than the sum of its proper divisors (3713475484795).
11130222210213 is an equidigital number, since it uses as much as digits as its factorization.
11130222210213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850353683.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11130222210213 its reverse (31201222203111), we get a palindrome (42331444413324).
The spelling of 11130222210213 in words is "eleven trillion, one hundred thirty billion, two hundred twenty-two million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •