Base | Representation |
---|---|
bin | 10011100100010110… |
… | …101110101110101001 |
3 | 2000020021222001210110 |
4 | 103210112232232221 |
5 | 321012311024001 |
6 | 13352523204533 |
7 | 1342446555660 |
oct | 234426565651 |
9 | 60207861713 |
10 | 21011033001 |
11 | 8a021a9092 |
12 | 40a4676749 |
13 | 1c9aca890a |
14 | 10346a5dd7 |
15 | 82e8cb3d6 |
hex | 4e45aeba9 |
21011033001 has 8 divisors (see below), whose sum is σ = 32016812224. Its totient is φ = 12006304560.
The previous prime is 21011032981. The next prime is 21011033003. The reversal of 21011033001 is 10033011012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21011033001 - 29 = 21011032489 is a prime.
It is a super-2 number, since 2×210110330012 (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 (21011033003) 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 7 ways as a sum of consecutive naturals, for example, 500262670 + ... + 500262711.
It is an arithmetic number, because the mean of its divisors is an integer number (4002101528).
Almost surely, 221011033001 is an apocalyptic number.
21011033001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21011033001 is a deficient number, since it is larger than the sum of its proper divisors (11005779223).
21011033001 is a wasteful number, since it uses less digits than its factorization.
21011033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000525391.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 21011033001 its reverse (10033011012), we get a palindrome (31044044013).
The spelling of 21011033001 in words is "twenty-one billion, eleven million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •