Base | Representation |
---|---|
bin | 100101001011101011101… |
… | …1101101111100000011001 |
3 | 200002112122202101022110101 |
4 | 1022113113131233200121 |
5 | 1132211424214410040 |
6 | 14511353105015401 |
7 | 1035131523620401 |
oct | 112272735574031 |
9 | 20075582338411 |
10 | 5110331013145 |
11 | 16a03086a3756 |
12 | 6a64bb624561 |
13 | 2b0b9602a127 |
14 | 1394ac8d3801 |
15 | 8cde890209a |
hex | 4a5d776f819 |
5110331013145 has 8 divisors (see below), whose sum is σ = 6132591831240. Its totient is φ = 4088135066880.
The previous prime is 5110331013061. The next prime is 5110331013157. The reversal of 5110331013145 is 5413101330115.
5110331013145 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 26947520649 + 5083383492496 = 164157^2 + 2254636^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5110331013145 - 27 = 5110331013017 is a prime.
It is a super-2 number, since 2×51103310131452 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16044480 + ... + 16359889.
It is an arithmetic number, because the mean of its divisors is an integer number (766573978905).
Almost surely, 25110331013145 is an apocalyptic number.
It is an amenable number.
5110331013145 is a deficient number, since it is larger than the sum of its proper divisors (1022260818095).
5110331013145 is a wasteful number, since it uses less digits than its factorization.
5110331013145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32435915.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 5110331013145 in words is "five trillion, one hundred ten billion, three hundred thirty-one million, thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •