Base | Representation |
---|---|
bin | 100101001011100100110… |
… | …1100111000011110001000 |
3 | 200002112001122212202112201 |
4 | 1022113021230320132020 |
5 | 1132210441111213000 |
6 | 14511314135445544 |
7 | 1035123021115216 |
oct | 112271154703610 |
9 | 20075048782481 |
10 | 5110100101000 |
11 | 16a01aa317a74 |
12 | 6a64562268b4 |
13 | 2b0b5a23b91b |
14 | 139489d85cb6 |
15 | 8cdd34dd96a |
hex | 4a5c9b38788 |
5110100101000 has 32 divisors (see below), whose sum is σ = 11957634238680. Its totient is φ = 2044040040000.
The previous prime is 5110100100997. The next prime is 5110100101079. The reversal of 5110100101000 is 1010010115.
It can be written as a sum of positive squares in 4 ways, for example, as 2431123350436 + 2678976750564 = 1559206^2 + 1636758^2 .
It is a super-2 number, since 2×51101001010002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 2555049051 + ... + 2555051050.
Almost surely, 25110100101000 is an apocalyptic number.
5110100101000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5110100101000 is an abundant number, since it is smaller than the sum of its proper divisors (6847534137680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110100101000 is a wasteful number, since it uses less digits than its factorization.
5110100101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5110100122 (or 5110100108 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 5110100101000 its reverse (1010010115), we get a palindrome (5111110111115).
The spelling of 5110100101000 in words is "five trillion, one hundred ten billion, one hundred million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.422 sec. • engine limits •