Base | Representation |
---|---|
bin | 100110011010… |
… | …1001111001001 |
3 | 1101220021021000 |
4 | 1030311033021 |
5 | 20124003001 |
6 | 1555405213 |
7 | 333124056 |
oct | 114651711 |
9 | 41807230 |
10 | 20141001 |
11 | 10407261 |
12 | 68b3809 |
13 | 423266a |
14 | 296402d |
15 | 1b7ca86 |
hex | 13353c9 |
20141001 has 16 divisors (see below), whose sum is σ = 29929600. Its totient is φ = 13386384.
The previous prime is 20140999. The next prime is 20141003. The reversal of 20141001 is 10014102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20140999) and next prime (20141003).
It is not a de Polignac number, because 20141001 - 21 = 20140999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20141003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9780 + ... + 11658.
It is an arithmetic number, because the mean of its divisors is an integer number (1870600).
Almost surely, 220141001 is an apocalyptic number.
It is an amenable number.
20141001 is a deficient number, since it is larger than the sum of its proper divisors (9788599).
20141001 is a wasteful number, since it uses less digits than its factorization.
20141001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2285 (or 2279 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 20141001 is about 4487.8726586212. The cubic root of 20141001 is about 272.0781611089.
Adding to 20141001 its reverse (10014102), we get a palindrome (30155103).
The spelling of 20141001 in words is "twenty million, one hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •