Base | Representation |
---|---|
bin | 1010010010111111101101… |
… | …0000100000100110010101 |
3 | 1111002022122121111201022222 |
4 | 2210233323100200212111 |
5 | 2440442314240442010 |
6 | 40025000531232125 |
7 | 2245643122116116 |
oct | 244577320404625 |
9 | 44068577451288 |
10 | 11321454234005 |
11 | 3675446846813 |
12 | 132a210148645 |
13 | 6417bacb7686 |
14 | 2b1d65b8c20d |
15 | 14976c5dd355 |
hex | a4bfb420995 |
11321454234005 has 16 divisors (see below), whose sum is σ = 13673076484080. Its totient is φ = 8998949187072.
The previous prime is 11321454233993. The next prime is 11321454234017. The reversal of 11321454234005 is 50043245412311.
It is an interprime number because it is at equal distance from previous prime (11321454233993) and next prime (11321454234017).
It can be written as a sum of positive squares in 8 ways, for example, as 2323716091876 + 8997738142129 = 1524374^2 + 2999623^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321454234005 - 210 = 11321454232981 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13323011 + ... + 14147279.
It is an arithmetic number, because the mean of its divisors is an integer number (854567280255).
Almost surely, 211321454234005 is an apocalyptic number.
It is an amenable number.
11321454234005 is a deficient number, since it is larger than the sum of its proper divisors (2351622250075).
11321454234005 is a wasteful number, since it uses less digits than its factorization.
11321454234005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841928.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 11321454234005 its reverse (50043245412311), we get a palindrome (61364699646316).
The spelling of 11321454234005 in words is "eleven trillion, three hundred twenty-one billion, four hundred fifty-four million, two hundred thirty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •