Base | Representation |
---|---|
bin | 100101001011100101010… |
… | …0110000110101110011111 |
3 | 200002112002201002212111110 |
4 | 1022113022212012232133 |
5 | 1132211003431222344 |
6 | 14511315433153103 |
7 | 1035123262452564 |
oct | 112271246065637 |
9 | 20075081085443 |
10 | 5110115101599 |
11 | 16a0207833162 |
12 | 6a645b25b793 |
13 | 2b0b60391611 |
14 | 13948bd6c86b |
15 | 8cdd49a33b9 |
hex | 4a5ca986b9f |
5110115101599 has 16 divisors (see below), whose sum is σ = 6817066329600. Its totient is φ = 3404953902336.
The previous prime is 5110115101591. The next prime is 5110115101601. The reversal of 5110115101599 is 9951015110115.
It is not a de Polignac number, because 5110115101599 - 23 = 5110115101591 is a prime.
It is a super-2 number, since 2×51101151015992 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110115101591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105254272 + ... + 105302810.
It is an arithmetic number, because the mean of its divisors is an integer number (426066645600).
Almost surely, 25110115101599 is an apocalyptic number.
5110115101599 is a deficient number, since it is larger than the sum of its proper divisors (1706951228001).
5110115101599 is a wasteful number, since it uses less digits than its factorization.
5110115101599 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66254.
The product of its (nonzero) digits is 10125, while the sum is 39.
The spelling of 5110115101599 in words is "five trillion, one hundred ten billion, one hundred fifteen million, one hundred one thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •