Base | Representation |
---|---|
bin | 10100111000100100… |
… | …11011111100001010 |
3 | 1001221101101021211200 |
4 | 22130102123330022 |
5 | 140430233411242 |
6 | 5052320205030 |
7 | 544562353326 |
oct | 123422337412 |
9 | 31841337750 |
10 | 11212013322 |
11 | 4833986614 |
12 | 220aa69776 |
13 | 1098b29a13 |
14 | 7850dc986 |
15 | 4594bd04c |
hex | 29c49bf0a |
11212013322 has 24 divisors (see below), whose sum is σ = 24345870276. Its totient is φ = 3729157056.
The previous prime is 11212013291. The next prime is 11212013339. The reversal of 11212013322 is 22331021211.
11212013322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11174815521 + 37197801 = 105711^2 + 6099^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11212013295 and 11212013304.
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 in 11 ways as a sum of consecutive naturals, for example, 673273 + ... + 689724.
Almost surely, 211212013322 is an apocalyptic number.
11212013322 is an abundant number, since it is smaller than the sum of its proper divisors (13133856954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212013322 is a wasteful number, since it uses less digits than its factorization.
11212013322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363462 (or 1363459 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11212013322 its reverse (22331021211), we get a palindrome (33543034533).
The spelling of 11212013322 in words is "eleven billion, two hundred twelve million, thirteen thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •