Base | Representation |
---|---|
bin | 10110010110101010… |
… | …10000001001101101 |
3 | 1010222101112020000212 |
4 | 23023111100021231 |
5 | 144034311434441 |
6 | 5302513032205 |
7 | 603255126221 |
oct | 131325201155 |
9 | 33871466025 |
10 | 12001280621 |
11 | 50a9456840 |
12 | 23ab255665 |
13 | 11934c26a5 |
14 | 81bc72781 |
15 | 4a3924eeb |
hex | 2cb55026d |
12001280621 has 8 divisors (see below), whose sum is σ = 13339331424. Its totient is φ = 10704400720.
The previous prime is 12001280587. The next prime is 12001280647. The reversal of 12001280621 is 12608210021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12001280621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001280021) 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, 10292111 + ... + 10293276.
It is an arithmetic number, because the mean of its divisors is an integer number (1667416428).
Almost surely, 212001280621 is an apocalyptic number.
12001280621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12001280621 is a deficient number, since it is larger than the sum of its proper divisors (1338050803).
12001280621 is a wasteful number, since it uses less digits than its factorization.
12001280621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20585451.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 12001280621 its reverse (12608210021), we get a palindrome (24609490642).
It can be divided in two parts, 1200 and 1280621, that added together give a palindrome (1281821).
The spelling of 12001280621 in words is "twelve billion, one million, two hundred eighty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •