Base | Representation |
---|---|
bin | 1010010010111111101000… |
… | …0000010001100111100011 |
3 | 1111002022121010221010122100 |
4 | 2210233322000101213203 |
5 | 2440442243344413443 |
6 | 40024554500341443 |
7 | 2245642445255553 |
oct | 244577200214743 |
9 | 44068533833570 |
10 | 11321433201123 |
11 | 3675435990471 |
12 | 132a2050a4883 |
13 | 6417b6832096 |
14 | 2b1d63075163 |
15 | 14976a8363d3 |
hex | a4bfa0119e3 |
11321433201123 has 24 divisors (see below), whose sum is σ = 16714292772528. Its totient is φ = 7381853773632.
The previous prime is 11321433201119. The next prime is 11321433201161. The reversal of 11321433201123 is 32110233412311.
11321433201123 is a `hidden beast` number, since 1 + 1 + 3 + 2 + 1 + 433 + 201 + 1 + 23 = 666.
It is not a de Polignac number, because 11321433201123 - 22 = 11321433201119 is a prime.
It is a super-2 number, since 2×113214332011232 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11321433200123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37285165 + ... + 37587582.
It is an arithmetic number, because the mean of its divisors is an integer number (696428865522).
Almost surely, 211321433201123 is an apocalyptic number.
11321433201123 is a deficient number, since it is larger than the sum of its proper divisors (5392859571405).
11321433201123 is a wasteful number, since it uses less digits than its factorization.
11321433201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74873123 (or 74873120 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 11321433201123 its reverse (32110233412311), we get a palindrome (43431666613434).
The spelling of 11321433201123 in words is "eleven trillion, three hundred twenty-one billion, four hundred thirty-three million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •