Base | Representation |
---|---|
bin | 100101001000110101011… |
… | …1000111101011010001101 |
3 | 200001221212111000102121101 |
4 | 1022101222320331122031 |
5 | 1132111412400323031 |
6 | 14504502130103101 |
7 | 1034524123043122 |
oct | 112215270753215 |
9 | 20057774012541 |
10 | 5104214464141 |
11 | 1698759aa8981 |
12 | 6a529311aa91 |
13 | 2b042ca75170 |
14 | 13908c426749 |
15 | 8cb8b946361 |
hex | 4a46ae3d68d |
5104214464141 has 8 divisors (see below), whose sum is σ = 5509367642240. Its totient is φ = 4700850042672.
The previous prime is 5104214464121. The next prime is 5104214464189. The reversal of 5104214464141 is 1414644124015.
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 5104214464141 - 215 = 5104214431373 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5104214464141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5104214464121) 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, 447183225 + ... + 447194638.
It is an arithmetic number, because the mean of its divisors is an integer number (688670955280).
Almost surely, 25104214464141 is an apocalyptic number.
It is an amenable number.
5104214464141 is a deficient number, since it is larger than the sum of its proper divisors (405153178099).
5104214464141 is a wasteful number, since it uses less digits than its factorization.
5104214464141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 894378315.
The product of its (nonzero) digits is 61440, while the sum is 37.
Adding to 5104214464141 its reverse (1414644124015), we get a palindrome (6518858588156).
The spelling of 5104214464141 in words is "five trillion, one hundred four billion, two hundred fourteen million, four hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •