Base | Representation |
---|---|
bin | 110000010011111… |
… | …0001110001001001 |
3 | 11011222021101002222 |
4 | 1200213301301021 |
5 | 11304441241301 |
6 | 424504303425 |
7 | 55112420504 |
oct | 14047616111 |
9 | 4158241088 |
10 | 1621040201 |
11 | 762042550 |
12 | 392a71b75 |
13 | 1caac17b1 |
14 | 11541013b |
15 | 974a831b |
hex | 609f1c49 |
1621040201 has 8 divisors (see below), whose sum is σ = 1768713408. Its totient is φ = 1473418000.
The previous prime is 1621040177. The next prime is 1621040227. The reversal of 1621040201 is 1020401261.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1621040201 - 26 = 1621040137 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1621040201.
It is not an unprimeable number, because it can be changed into a prime (1621040501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89156 + ... + 105786.
It is an arithmetic number, because the mean of its divisors is an integer number (221089176).
Almost surely, 21621040201 is an apocalyptic number.
1621040201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1621040201 is a deficient number, since it is larger than the sum of its proper divisors (147673207).
1621040201 is a wasteful number, since it uses less digits than its factorization.
1621040201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25503.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1621040201 is about 40262.1435221723. The cubic root of 1621040201 is about 1174.7116119772.
Adding to 1621040201 its reverse (1020401261), we get a palindrome (2641441462).
The spelling of 1621040201 in words is "one billion, six hundred twenty-one million, forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •