Base | Representation |
---|---|
bin | 100001101000000001000… |
… | …1100011010111100001011 |
3 | 121100210200211002212001212 |
4 | 1003100002030122330023 |
5 | 1101204132413333003 |
6 | 13455015104003335 |
7 | 654613064430515 |
oct | 103200214327413 |
9 | 17323624085055 |
10 | 4621421621003 |
11 | 1521a30030080 |
12 | 6277b490054b |
13 | 276a4b80c515 |
14 | 11d96c608bb5 |
15 | 803317a9dd8 |
hex | 4340231af0b |
4621421621003 has 16 divisors (see below), whose sum is σ = 5127192864000. Its totient is φ = 4129929379680.
The previous prime is 4621421620987. The next prime is 4621421621023. The reversal of 4621421621003 is 3001261241264.
4621421621003 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4621421621003 - 24 = 4621421620987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4621421621023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19418573 + ... + 19655121.
It is an arithmetic number, because the mean of its divisors is an integer number (320449554000).
Almost surely, 24621421621003 is an apocalyptic number.
4621421621003 is a deficient number, since it is larger than the sum of its proper divisors (505771242997).
4621421621003 is a wasteful number, since it uses less digits than its factorization.
4621421621003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266722.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 4621421621003 its reverse (3001261241264), we get a palindrome (7622682862267).
The spelling of 4621421621003 in words is "four trillion, six hundred twenty-one billion, four hundred twenty-one million, six hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •