Base | Representation |
---|---|
bin | 10011100101001010… |
… | …111001110101110001 |
3 | 2000021020200221010000 |
4 | 103211022321311301 |
5 | 321024311210001 |
6 | 13354132300213 |
7 | 1343004041421 |
oct | 234512716561 |
9 | 60236627100 |
10 | 21024710001 |
11 | 8a0999a899 |
12 | 40a9171669 |
13 | 1ca0a87009 |
14 | 1036426481 |
15 | 830bcda86 |
hex | 4e52b9d71 |
21024710001 has 15 divisors (see below), whose sum is σ = 31409232393. Its totient is φ = 14015603340.
The previous prime is 21024709961. The next prime is 21024710023. The reversal of 21024710001 is 10001742012.
The square root of 21024710001 is 144999.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 21024710001 - 211 = 21024707953 is a prime.
It is a super-2 number, since 2×210247100012 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21024710501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 1296936 + ... + 1313046.
Almost surely, 221024710001 is an apocalyptic number.
21024710001 is the 144999-th square number.
21024710001 is the 72500-th centered octagonal number.
It is an amenable number.
21024710001 is a deficient number, since it is larger than the sum of its proper divisors (10384522392).
21024710001 is an frugal number, since it uses more digits than its factorization.
21024710001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32234 (or 16114 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 18.
It can be divided in two parts, 21024 and 710001, that added together give a square (731025 = 8552).
The spelling of 21024710001 in words is "twenty-one billion, twenty-four million, seven hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •