Base | Representation |
---|---|
bin | 1010001111000001011100… |
… | …0101100010111101100101 |
3 | 1110211210110222012222021102 |
4 | 2203300113011202331211 |
5 | 2433333024110123123 |
6 | 35533352141325445 |
7 | 2241005553515300 |
oct | 243602705427545 |
9 | 43753428188242 |
10 | 11253201645413 |
11 | 3649501a5a802 |
12 | 1318b42566885 |
13 | 6382318a9690 |
14 | 2ac92d27db37 |
15 | 147ac55e9028 |
hex | a3c17162f65 |
11253201645413 has 48 divisors (see below), whose sum is σ = 14210354995200. Its totient is φ = 8832569163264.
The previous prime is 11253201645403. The next prime is 11253201645467. The reversal of 11253201645413 is 31454610235211.
11253201645413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11253201645413 - 28 = 11253201645157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11253201645403) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 42587420 + ... + 42850842.
It is an arithmetic number, because the mean of its divisors is an integer number (296049062400).
Almost surely, 211253201645413 is an apocalyptic number.
11253201645413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11253201645413 is a deficient number, since it is larger than the sum of its proper divisors (2957153349787).
11253201645413 is a wasteful number, since it uses less digits than its factorization.
11253201645413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 263986 (or 263979 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 11253201645413 in words is "eleven trillion, two hundred fifty-three billion, two hundred one million, six hundred forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •