Base | Representation |
---|---|
bin | 10100100000110001… |
… | …10000100110010011 |
3 | 1001102110200001022102 |
4 | 22100120300212103 |
5 | 140023130003321 |
6 | 5020424431015 |
7 | 536616244541 |
oct | 122030604623 |
9 | 31373601272 |
10 | 11012344211 |
11 | 47411aa220 |
12 | 217401846b |
13 | 106665a20b |
14 | 7667a4d91 |
15 | 446bcbc0b |
hex | 290630993 |
11012344211 has 8 divisors (see below), whose sum is σ = 12132412848. Its totient is φ = 9912100000.
The previous prime is 11012344207. The next prime is 11012344219. The reversal of 11012344211 is 11244321011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012344211 - 22 = 11012344207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012344219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4954940 + ... + 4957161.
It is an arithmetic number, because the mean of its divisors is an integer number (1516551606).
Almost surely, 211012344211 is an apocalyptic number.
11012344211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11012344211 is a deficient number, since it is larger than the sum of its proper divisors (1120068637).
11012344211 is a wasteful number, since it uses less digits than its factorization.
11012344211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9912213.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11012344211 its reverse (11244321011), we get a palindrome (22256665222).
It can be divided in two parts, 110 and 12344211, that added together give a palindrome (12344321).
The spelling of 11012344211 in words is "eleven billion, twelve million, three hundred forty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •