Base | Representation |
---|---|
bin | 10011100011101101… |
… | …001011011000100101 |
3 | 2000012112110122212000 |
4 | 103203231023120211 |
5 | 321002013442300 |
6 | 13351453515513 |
7 | 1342255150623 |
oct | 234355133045 |
9 | 60175418760 |
10 | 21000140325 |
11 | 89a703927a |
12 | 40a0aa2b99 |
13 | 1c98963948 |
14 | 103306c513 |
15 | 82d978c00 |
hex | 4e3b4b625 |
21000140325 has 24 divisors (see below), whose sum is σ = 38578036800. Its totient is φ = 11200074480.
The previous prime is 21000140323. The next prime is 21000140333. The reversal of 21000140325 is 52304100012.
It is not a de Polignac number, because 21000140325 - 21 = 21000140323 is a prime.
It is a super-2 number, since 2×210001403252 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21000140298 and 21000140307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000140321) 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, 15554985 + ... + 15556334.
It is an arithmetic number, because the mean of its divisors is an integer number (1607418200).
Almost surely, 221000140325 is an apocalyptic number.
21000140325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21000140325 is a deficient number, since it is larger than the sum of its proper divisors (17577896475).
21000140325 is a wasteful number, since it uses less digits than its factorization.
21000140325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31111338 (or 31111327 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
Adding to 21000140325 its reverse (52304100012), we get a palindrome (73304240337).
The spelling of 21000140325 in words is "twenty-one billion, one hundred forty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •