Base | Representation |
---|---|
bin | 10011000000100010… |
… | …110010001010001001 |
3 | 1221200102102020200212 |
4 | 103000202302022021 |
5 | 313300003304001 |
6 | 13213141410505 |
7 | 1321532643113 |
oct | 230042621211 |
9 | 57612366625 |
10 | 20410213001 |
11 | 8724040132 |
12 | 3b57409a35 |
13 | 1c03683a19 |
14 | db89883b3 |
15 | 7e6c9a7bb |
hex | 4c08b2289 |
20410213001 has 4 divisors (see below), whose sum is σ = 20411473104. Its totient is φ = 20408952900.
The previous prime is 20410212989. The next prime is 20410213013. The reversal of 20410213001 is 10031201402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (20410212989) and next prime (20410213013).
It is a cyclic number.
It is not a de Polignac number, because 20410213001 - 226 = 20343104137 is a prime.
It is a super-3 number, since 3×204102130013 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20410213081) 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, 605435 + ... + 638256.
It is an arithmetic number, because the mean of its divisors is an integer number (5102868276).
Almost surely, 220410213001 is an apocalyptic number.
It is an amenable number.
20410213001 is a deficient number, since it is larger than the sum of its proper divisors (1260103).
20410213001 is a wasteful number, since it uses less digits than its factorization.
20410213001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1260102.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20410213001 its reverse (10031201402), we get a palindrome (30441414403).
The spelling of 20410213001 in words is "twenty billion, four hundred ten million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •