Base | Representation |
---|---|
bin | 1011111011001011111001… |
… | …0100000111110101011000 |
3 | 1201102102220022121020002101 |
4 | 2332302332110013311120 |
5 | 3204304203340232100 |
6 | 43515150443213144 |
7 | 2522161351533340 |
oct | 276627624076530 |
9 | 51372808536071 |
10 | 13111433133400 |
11 | 41a558920a178 |
12 | 15791005171b4 |
13 | 741531065044 |
14 | 33484d6a3d20 |
15 | 17b0d24bb86a |
hex | becbe507d58 |
13111433133400 has 48 divisors (see below), whose sum is σ = 34838950901040. Its totient is φ = 4495348502400.
The previous prime is 13111433133373. The next prime is 13111433133413. The reversal of 13111433133400 is 433133411131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4682653291 + ... + 4682656090.
It is an arithmetic number, because the mean of its divisors is an integer number (725811477105).
Almost surely, 213111433133400 is an apocalyptic number.
13111433133400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13111433133400 is an abundant number, since it is smaller than the sum of its proper divisors (21727517767640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111433133400 is a wasteful number, since it uses less digits than its factorization.
13111433133400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9365309404 (or 9365309395 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 13111433133400 its reverse (433133411131), we get a palindrome (13544566544531).
The spelling of 13111433133400 in words is "thirteen trillion, one hundred eleven billion, four hundred thirty-three million, one hundred thirty-three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •