Base | Representation |
---|---|
bin | 10011111110111101… |
… | …001001100111001001 |
3 | 2001101101201101202201 |
4 | 103332331021213021 |
5 | 322421032442301 |
6 | 13505104400201 |
7 | 1356506100343 |
oct | 237675114711 |
9 | 61341641681 |
10 | 21457312201 |
11 | 9111103276 |
12 | 41aa016061 |
13 | 203c5a1b50 |
14 | 1077a76293 |
15 | 858b82201 |
hex | 4fef499c9 |
21457312201 has 4 divisors (see below), whose sum is σ = 23107874692. Its totient is φ = 19806749712.
The previous prime is 21457312189. The next prime is 21457312207. The reversal of 21457312201 is 10221375412.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14707868176 + 6749444025 = 121276^2 + 82155^2 .
It is a cyclic number.
It is not a de Polignac number, because 21457312201 - 211 = 21457310153 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21457312201.
It is not an unprimeable number, because it can be changed into a prime (21457312207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 825281226 + ... + 825281251.
It is an arithmetic number, because the mean of its divisors is an integer number (5776968673).
Almost surely, 221457312201 is an apocalyptic number.
It is an amenable number.
21457312201 is a deficient number, since it is larger than the sum of its proper divisors (1650562491).
21457312201 is a wasteful number, since it uses less digits than its factorization.
21457312201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1650562490.
The product of its (nonzero) digits is 3360, while the sum is 28.
Adding to 21457312201 its reverse (10221375412), we get a palindrome (31678687613).
The spelling of 21457312201 in words is "twenty-one billion, four hundred fifty-seven million, three hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •