Base | Representation |
---|---|
bin | 10100100100110011… |
… | …11101100111110100 |
3 | 1001111211101211002221 |
4 | 22102121331213310 |
5 | 140110312323012 |
6 | 5024034412124 |
7 | 540510161632 |
oct | 122231754764 |
9 | 31454354087 |
10 | 11046214132 |
11 | 4759333198 |
12 | 2183431044 |
13 | 10706887a5 |
14 | 76b0a0352 |
15 | 449b6c507 |
hex | 29267d9f4 |
11046214132 has 12 divisors (see below), whose sum is σ = 19333442016. Its totient is φ = 5522373560.
The previous prime is 11046214103. The next prime is 11046214181. The reversal of 11046214132 is 23141264011.
It is a junction number, because it is equal to n+sod(n) for n = 11046214097 and 11046214106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148768 + ... + 210295.
It is an arithmetic number, because the mean of its divisors is an integer number (1611120168).
Almost surely, 211046214132 is an apocalyptic number.
It is an amenable number.
11046214132 is a deficient number, since it is larger than the sum of its proper divisors (8287227884).
11046214132 is a wasteful number, since it uses less digits than its factorization.
11046214132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366758 (or 366756 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11046214132 its reverse (23141264011), we get a palindrome (34187478143).
The spelling of 11046214132 in words is "eleven billion, forty-six million, two hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •