Base | Representation |
---|---|
bin | 1001100110100010101100… |
… | …00100100001101011010001 |
3 | 2202202121210201122012002102 |
4 | 10303101112010201223101 |
5 | 10231424022313113400 |
6 | 112524154524130145 |
7 | 4306354566155222 |
oct | 463212604415321 |
9 | 82677721565072 |
10 | 21115503254225 |
11 | 680104211a426 |
12 | 24503ab396955 |
13 | ba224cc5c403 |
14 | 52ddd270b249 |
15 | 2693e19089d5 |
hex | 133456121ad1 |
21115503254225 has 24 divisors (see below), whose sum is σ = 26217877490112. Its totient is φ = 16870050014400.
The previous prime is 21115503254179. The next prime is 21115503254227. The reversal of 21115503254225 is 52245230551112.
It is not a de Polignac number, because 21115503254225 - 26 = 21115503254161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21115503254227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 209053235 + ... + 209154215.
It is an arithmetic number, because the mean of its divisors is an integer number (1092411562088).
Almost surely, 221115503254225 is an apocalyptic number.
21115503254225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21115503254225 is a deficient number, since it is larger than the sum of its proper divisors (5102374235887).
21115503254225 is a wasteful number, since it uses less digits than its factorization.
21115503254225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111977 (or 111972 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 21115503254225 in words is "twenty-one trillion, one hundred fifteen billion, five hundred three million, two hundred fifty-four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •