Base | Representation |
---|---|
bin | 1011111100011110001011… |
… | …1110011110001001100111 |
3 | 1201111112220210200022110210 |
4 | 2333013202332132021213 |
5 | 3210134423400113421 |
6 | 43533242430550503 |
7 | 2523602641662651 |
oct | 277074276361147 |
9 | 51445823608423 |
10 | 13133523051111 |
11 | 4203994410311 |
12 | 1581446368433 |
13 | 74364170a678 |
14 | 33594736d6d1 |
15 | 17b97695c576 |
hex | bf1e2f9e267 |
13133523051111 has 8 divisors (see below), whose sum is σ = 17522166890224. Its totient is φ = 8750280623040.
The previous prime is 13133523051079. The next prime is 13133523051139. The reversal of 13133523051111 is 11115032533131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13133523051111 - 25 = 13133523051079 is a prime.
It is a super-3 number, since 3×131335230511113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133523051191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1350347086 + ... + 1350356811.
It is an arithmetic number, because the mean of its divisors is an integer number (2190270861278).
Almost surely, 213133523051111 is an apocalyptic number.
13133523051111 is a deficient number, since it is larger than the sum of its proper divisors (4388643839113).
13133523051111 is a wasteful number, since it uses less digits than its factorization.
13133523051111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700705521.
The product of its (nonzero) digits is 4050, while the sum is 30.
Adding to 13133523051111 its reverse (11115032533131), we get a palindrome (24248555584242).
The spelling of 13133523051111 in words is "thirteen trillion, one hundred thirty-three billion, five hundred twenty-three million, fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •