Base | Representation |
---|---|
bin | 100101000111110111000… |
… | …0100011010110101101001 |
3 | 200001202110112111200202221 |
4 | 1022033232010122311221 |
5 | 1132043120300110030 |
6 | 14503514241154041 |
7 | 1034421204061540 |
oct | 112175604326551 |
9 | 20052415450687 |
10 | 5102120316265 |
11 | 16978849a7655 |
12 | 6a49a992b921 |
13 | 2b0187c55bcb |
14 | 138d30261157 |
15 | 8cab7b87e7a |
hex | 4a3ee11ad69 |
5102120316265 has 8 divisors (see below), whose sum is σ = 6997193576640. Its totient is φ = 3498596788272.
The previous prime is 5102120316263. The next prime is 5102120316311. The reversal of 5102120316265 is 5626130212015.
5102120316265 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5102120316265 - 21 = 5102120316263 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5102120316265.
It is not an unprimeable number, because it can be changed into a prime (5102120316263) 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, 72887433055 + ... + 72887433124.
It is an arithmetic number, because the mean of its divisors is an integer number (874649197080).
Almost surely, 25102120316265 is an apocalyptic number.
It is an amenable number.
5102120316265 is a deficient number, since it is larger than the sum of its proper divisors (1895073260375).
5102120316265 is a wasteful number, since it uses less digits than its factorization.
5102120316265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145774866191.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 5102120316265 in words is "five trillion, one hundred two billion, one hundred twenty million, three hundred sixteen thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •