Base | Representation |
---|---|
bin | 1100100111010010010… |
… | …0000101011010101001 |
3 | 202201100110202211222201 |
4 | 3021310210011122221 |
5 | 12022302204344400 |
6 | 243315154220201 |
7 | 21441061306504 |
oct | 3116444053251 |
9 | 681313684881 |
10 | 216703981225 |
11 | 839a3825566 |
12 | 35bb9884661 |
13 | 17586ba9934 |
14 | a6ba74613b |
15 | 5984b7706a |
hex | 32749056a9 |
216703981225 has 24 divisors (see below), whose sum is σ = 269885226240. Its totient is φ = 172607400000.
The previous prime is 216703981223. The next prime is 216703981259. The reversal of 216703981225 is 522189307612.
It is not a de Polignac number, because 216703981225 - 21 = 216703981223 is a prime.
It is a hoax number, since the sum of its digits (46) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (216703981223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23269320 + ... + 23278630.
It is an arithmetic number, because the mean of its divisors is an integer number (11245217760).
Almost surely, 2216703981225 is an apocalyptic number.
216703981225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
216703981225 is a deficient number, since it is larger than the sum of its proper divisors (53181245015).
216703981225 is a wasteful number, since it uses less digits than its factorization.
216703981225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13281 (or 13276 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 216703981225 in words is "two hundred sixteen billion, seven hundred three million, nine hundred eighty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •