Base | Representation |
---|---|
bin | 1010011001100011011011… |
… | …0011100101001001011001 |
3 | 1111111002110122121020210020 |
4 | 2212120312303211021121 |
5 | 2444314040320324423 |
6 | 40152432513541053 |
7 | 2260042133033532 |
oct | 246306663451131 |
9 | 44432418536706 |
10 | 11434122433113 |
11 | 3709203032356 |
12 | 1348014574789 |
13 | 64c305215403 |
14 | 2b75b3487689 |
15 | 14c663a884e3 |
hex | a6636ce5259 |
11434122433113 has 16 divisors (see below), whose sum is σ = 15524268062400. Its totient is φ = 7483702100480.
The previous prime is 11434122433093. The next prime is 11434122433159. The reversal of 11434122433113 is 31133422143411.
It is a happy number.
11434122433113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11434122433113 - 26 = 11434122433049 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11434122433183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42309168 + ... + 42578561.
It is an arithmetic number, because the mean of its divisors is an integer number (970266753900).
Almost surely, 211434122433113 is an apocalyptic number.
It is an amenable number.
11434122433113 is a deficient number, since it is larger than the sum of its proper divisors (4090145629287).
11434122433113 is an equidigital number, since it uses as much as digits as its factorization.
11434122433113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84888552.
The product of its digits is 20736, while the sum is 33.
Adding to 11434122433113 its reverse (31133422143411), we get a palindrome (42567544576524).
The spelling of 11434122433113 in words is "eleven trillion, four hundred thirty-four billion, one hundred twenty-two million, four hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •