Base | Representation |
---|---|
bin | 10011100101101010… |
… | …111101111010111101 |
3 | 2000021211111222001022 |
4 | 103211222331322331 |
5 | 321033434142300 |
6 | 13355032353525 |
7 | 1343135346635 |
oct | 234552757275 |
9 | 60254458038 |
10 | 21033115325 |
11 | 8a13710942 |
12 | 40abb458a5 |
13 | 1ca273aa91 |
14 | 10375b36c5 |
15 | 8317de285 |
hex | 4e5abdebd |
21033115325 has 24 divisors (see below), whose sum is σ = 27247416768. Its totient is φ = 16075748480.
The previous prime is 21033115283. The next prime is 21033115357. The reversal of 21033115325 is 52351133012.
It is not a de Polignac number, because 21033115325 - 214 = 21033098941 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21033115294 and 21033115303.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 471434 + ... + 514116.
It is an arithmetic number, because the mean of its divisors is an integer number (1135309032).
Almost surely, 221033115325 is an apocalyptic number.
21033115325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21033115325 is a deficient number, since it is larger than the sum of its proper divisors (6214301443).
21033115325 is a wasteful number, since it uses less digits than its factorization.
21033115325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43573 (or 43568 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 21033115325 its reverse (52351133012), we get a palindrome (73384248337).
The spelling of 21033115325 in words is "twenty-one billion, thirty-three million, one hundred fifteen thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •