Base | Representation |
---|---|
bin | 1010010011100111110010… |
… | …0010011110111110011101 |
3 | 1111010100102102021211200211 |
4 | 2210321330202132332131 |
5 | 2441131333031011110 |
6 | 40033540304052421 |
7 | 2246503543246102 |
oct | 244717442367635 |
9 | 44110372254624 |
10 | 11332213141405 |
11 | 3679a67985122 |
12 | 1330313304111 |
13 | 642813c9aa80 |
14 | 2b26a6a20aa9 |
15 | 149b9be0798a |
hex | a4e7c89ef9d |
11332213141405 has 8 divisors (see below), whose sum is σ = 14644706213592. Its totient is φ = 8368403550528.
The previous prime is 11332213141367. The next prime is 11332213141427. The reversal of 11332213141405 is 50414131223311.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1282970778489 + 10049242362916 = 1132683^2 + 3170054^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11332213141405 - 215 = 11332213108637 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87170870254 + ... + 87170870383.
It is an arithmetic number, because the mean of its divisors is an integer number (1830588276699).
Almost surely, 211332213141405 is an apocalyptic number.
It is an amenable number.
11332213141405 is a deficient number, since it is larger than the sum of its proper divisors (3312493072187).
11332213141405 is a wasteful number, since it uses less digits than its factorization.
11332213141405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174341740655.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 11332213141405 its reverse (50414131223311), we get a palindrome (61746344364716).
The spelling of 11332213141405 in words is "eleven trillion, three hundred thirty-two billion, two hundred thirteen million, one hundred forty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •