Base | Representation |
---|---|
bin | 1010001100100010000010… |
… | …0101010111110010000100 |
3 | 1110200201000211122201110202 |
4 | 2203020200211113302010 |
5 | 2432132410243411322 |
6 | 35501554124110032 |
7 | 2234632304621402 |
oct | 243104045276204 |
9 | 43621024581422 |
10 | 11210411310212 |
11 | 3632343a25614 |
12 | 13107a0095318 |
13 | 6341a2701cca |
14 | 2aa830286472 |
15 | 14691db86292 |
hex | a3220957c84 |
11210411310212 has 6 divisors (see below), whose sum is σ = 19618219792878. Its totient is φ = 5605205655104.
The previous prime is 11210411310199. The next prime is 11210411310257. The reversal of 11210411310212 is 21201311401211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 11184703677316 + 25707632896 = 3344354^2 + 160336^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1401301413773 + ... + 1401301413780.
It is an arithmetic number, because the mean of its divisors is an integer number (3269703298813).
Almost surely, 211210411310212 is an apocalyptic number.
It is an amenable number.
11210411310212 is a deficient number, since it is larger than the sum of its proper divisors (8407808482666).
11210411310212 is a wasteful number, since it uses less digits than its factorization.
11210411310212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2802602827557 (or 2802602827555 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 11210411310212 its reverse (21201311401211), we get a palindrome (32411722711423).
Subtracting 11210411310212 from its reverse (21201311401211), we obtain a palindrome (9990900090999).
The spelling of 11210411310212 in words is "eleven trillion, two hundred ten billion, four hundred eleven million, three hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •