Base | Representation |
---|---|
bin | 1010000000110111011111… |
… | …0111011100000011111011 |
3 | 1102222112202200101012100111 |
4 | 2200031313313130003323 |
5 | 2420342001110414321 |
6 | 35225532455445151 |
7 | 2214306236403322 |
oct | 240156767340373 |
9 | 42875680335314 |
10 | 11010012201211 |
11 | 3565357947971 |
12 | 12999929867b7 |
13 | 61b3167c3c7a |
14 | 2a0c5d1930b9 |
15 | 1415e06775e1 |
hex | a0377ddc0fb |
11010012201211 has 16 divisors (see below), whose sum is σ = 11323734364800. Its totient is φ = 10698979027968.
The previous prime is 11010012201107. The next prime is 11010012201233. The reversal of 11010012201211 is 11210221001011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11010012201211 - 227 = 11009877983483 is a prime.
It is a super-3 number, since 3×110100122012113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010012201191 and 11010012201200.
It is not an unprimeable number, because it can be changed into a prime (11010012201281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13352980 + ... + 14153518.
It is an arithmetic number, because the mean of its divisors is an integer number (707733397800).
Almost surely, 211010012201211 is an apocalyptic number.
11010012201211 is a deficient number, since it is larger than the sum of its proper divisors (313722163589).
11010012201211 is a wasteful number, since it uses less digits than its factorization.
11010012201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802218.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11010012201211 its reverse (11210221001011), we get a palindrome (22220233202222).
The spelling of 11010012201211 in words is "eleven trillion, ten billion, twelve million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •