Base | Representation |
---|---|
bin | 10011100110101111… |
… | …110000111111110101 |
3 | 2000100002110020102021 |
4 | 103212233300333311 |
5 | 321103043302300 |
6 | 13400515113141 |
7 | 1343444553052 |
oct | 234657607765 |
9 | 60302406367 |
10 | 21051150325 |
11 | 8a229098a7 |
12 | 40b5ba27b1 |
13 | 1ca63b398a |
14 | 1039b4a029 |
15 | 8331a2d1a |
hex | 4e6bf0ff5 |
21051150325 has 48 divisors (see below), whose sum is σ = 27067910400. Its totient is φ = 16232832000.
The previous prime is 21051150287. The next prime is 21051150343. The reversal of 21051150325 is 52305115012.
It is not a de Polignac number, because 21051150325 - 229 = 20514279413 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 21051150325.
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 47 ways as a sum of consecutive naturals, for example, 21546237 + ... + 21547213.
It is an arithmetic number, because the mean of its divisors is an integer number (563914800).
Almost surely, 221051150325 is an apocalyptic number.
21051150325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21051150325 is a deficient number, since it is larger than the sum of its proper divisors (6016760075).
21051150325 is a wasteful number, since it uses less digits than its factorization.
21051150325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1318 (or 1313 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 21051150325 its reverse (52305115012), we get a palindrome (73356265337).
The spelling of 21051150325 in words is "twenty-one billion, fifty-one million, one hundred fifty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •