Base | Representation |
---|---|
bin | 100100011110000110000… |
… | …1000100011011010000001 |
3 | 122202011221220010000221221 |
4 | 1020330030020203122001 |
5 | 1124110424140400301 |
6 | 14354402335115041 |
7 | 1025064461305534 |
oct | 110741410433201 |
9 | 18664856100857 |
10 | 5012430403201 |
11 | 166283a31a461 |
12 | 68b538972a81 |
13 | 2a4893453a30 |
14 | 134862600a1b |
15 | 8a5b8b5dda1 |
hex | 48f0c223681 |
5012430403201 has 8 divisors (see below), whose sum is σ = 5398971345320. Its totient is φ = 4626027942912.
The previous prime is 5012430403187. The next prime is 5012430403273. The reversal of 5012430403201 is 1023040342105.
It can be written as a sum of positive squares in 4 ways, for example, as 74679772176 + 4937750631025 = 273276^2 + 2222105^2 .
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-5012430403201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5012430403601) 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, 34545270 + ... + 34690063.
It is an arithmetic number, because the mean of its divisors is an integer number (674871418165).
Almost surely, 25012430403201 is an apocalyptic number.
It is an amenable number.
5012430403201 is a deficient number, since it is larger than the sum of its proper divisors (386540942119).
5012430403201 is a wasteful number, since it uses less digits than its factorization.
5012430403201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69240915.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 5012430403201 its reverse (1023040342105), we get a palindrome (6035470745306).
The spelling of 5012430403201 in words is "five trillion, twelve billion, four hundred thirty million, four hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •