Base | Representation |
---|---|
bin | 1010001100001010001110… |
… | …1110010011110111001001 |
3 | 1110200002112112011110120012 |
4 | 2203002203232103313021 |
5 | 2432031314003043103 |
6 | 35455020105041305 |
7 | 2234315045462600 |
oct | 243024356236711 |
9 | 43602475143505 |
10 | 11204021534153 |
11 | 362a665082258 |
12 | 130b4b8186235 |
13 | 6336c4964426 |
14 | 2aa3c57b4a37 |
15 | 146697c092d8 |
hex | a30a3b93dc9 |
11204021534153 has 24 divisors (see below), whose sum is σ = 13123523318400. Its totient is φ = 9536957052000.
The previous prime is 11204021534117. The next prime is 11204021534161. The reversal of 11204021534153 is 35143512040211.
11204021534153 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 11204021534153 - 214 = 11204021517769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11204021534113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34525550 + ... + 34848552.
It is an arithmetic number, because the mean of its divisors is an integer number (546813471600).
Almost surely, 211204021534153 is an apocalyptic number.
It is an amenable number.
11204021534153 is a deficient number, since it is larger than the sum of its proper divisors (1919501784247).
11204021534153 is a wasteful number, since it uses less digits than its factorization.
11204021534153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327917 (or 327910 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 11204021534153 its reverse (35143512040211), we get a palindrome (46347533574364).
The spelling of 11204021534153 in words is "eleven trillion, two hundred four billion, twenty-one million, five hundred thirty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •