Base | Representation |
---|---|
bin | 10011100110110010… |
… | …110011100000110001 |
3 | 2000100010221201022212 |
4 | 103212302303200301 |
5 | 321103244301212 |
6 | 13400544141505 |
7 | 1343454411641 |
oct | 234662634061 |
9 | 60303851285 |
10 | 21051947057 |
11 | 8a23303459 |
12 | 40b6307895 |
13 | 1ca660250b |
14 | 1039cb6521 |
15 | 8332ade22 |
hex | 4e6cb3831 |
21051947057 has 4 divisors (see below), whose sum is σ = 21059778660. Its totient is φ = 21044115456.
The previous prime is 21051947053. The next prime is 21051947069. The reversal of 21051947057 is 75074915012.
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 1465664656 + 19586282401 = 38284^2 + 139951^2 .
It is a cyclic number.
It is not a de Polignac number, because 21051947057 - 22 = 21051947053 is a prime.
It is a super-2 number, since 2×210519470572 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21051947053) 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 3 ways as a sum of consecutive naturals, for example, 3911768 + ... + 3917145.
It is an arithmetic number, because the mean of its divisors is an integer number (5264944665).
Almost surely, 221051947057 is an apocalyptic number.
It is an amenable number.
21051947057 is a deficient number, since it is larger than the sum of its proper divisors (7831603).
21051947057 is an equidigital number, since it uses as much as digits as its factorization.
21051947057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7831602.
The product of its (nonzero) digits is 88200, while the sum is 41.
The spelling of 21051947057 in words is "twenty-one billion, fifty-one million, nine hundred forty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •