Base | Representation |
---|---|
bin | 100101001011100101010… |
… | …0110000110101110100000 |
3 | 200002112002201002212111111 |
4 | 1022113022212012232200 |
5 | 1132211003431222400 |
6 | 14511315433153104 |
7 | 1035123262452565 |
oct | 112271246065640 |
9 | 20075081085444 |
10 | 5110115101600 |
11 | 16a0207833163 |
12 | 6a645b25b794 |
13 | 2b0b60391612 |
14 | 13948bd6c86c |
15 | 8cdd49a33ba |
hex | 4a5ca986ba0 |
5110115101600 has 72 divisors (see below), whose sum is σ = 13131651083040. Its totient is φ = 1936464664320.
The previous prime is 5110115101591. The next prime is 5110115101601. The reversal of 5110115101600 is 61015110115.
It is a super-2 number, since 2×51101151016002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5110115101601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 168080692 + ... + 168111091.
It is an arithmetic number, because the mean of its divisors is an integer number (182384042820).
Almost surely, 25110115101600 is an apocalyptic number.
5110115101600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5110115101600 is an abundant number, since it is smaller than the sum of its proper divisors (8021535981440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110115101600 is a wasteful number, since it uses less digits than its factorization.
5110115101600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336191822 (or 336191809 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 22.
The spelling of 5110115101600 in words is "five trillion, one hundred ten billion, one hundred fifteen million, one hundred one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •