Base | Representation |
---|---|
bin | 1010000001000111111000… |
… | …0100101101110000000101 |
3 | 1102222222010021002012001122 |
4 | 2200101332010231300011 |
5 | 2420430003243442013 |
6 | 35231541204003325 |
7 | 2214523244256515 |
oct | 240217604556005 |
9 | 42888107065048 |
10 | 11014411312133 |
11 | 356720504a029 |
12 | 129a800090545 |
13 | 61b868005398 |
14 | 2a1159519845 |
15 | 14179b987a08 |
hex | a047e12dc05 |
11014411312133 has 16 divisors (see below), whose sum is σ = 11231174329200. Its totient is φ = 10797982440960.
The previous prime is 11014411312117. The next prime is 11014411312153. The reversal of 11014411312133 is 33121311441011.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1497143122084 + 9517268190049 = 1223578^2 + 3085007^2 .
It is a cyclic number.
It is not a de Polignac number, because 11014411312133 - 24 = 11014411312117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014411312153) 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, 549913163 + ... + 549933191.
It is an arithmetic number, because the mean of its divisors is an integer number (701948395575).
Almost surely, 211014411312133 is an apocalyptic number.
It is an amenable number.
11014411312133 is a deficient number, since it is larger than the sum of its proper divisors (216763017067).
11014411312133 is a wasteful number, since it uses less digits than its factorization.
11014411312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27832.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 11014411312133 its reverse (33121311441011), we get a palindrome (44135722753144).
The spelling of 11014411312133 in words is "eleven trillion, fourteen billion, four hundred eleven million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •