Base | Representation |
---|---|
bin | 100101001011111111101… |
… | …0101111101010010101101 |
3 | 200002121101101022110201022 |
4 | 1022113333111331102231 |
5 | 1132214312003423401 |
6 | 14511543325023525 |
7 | 1035154226466464 |
oct | 112277725752255 |
9 | 20077341273638 |
10 | 5111000061101 |
11 | 16a0621322350 |
12 | 6a66676b4ba5 |
13 | 2b0c718200ac |
14 | 1395336d19db |
15 | 8ce3750d71b |
hex | 4a5ff57d4ad |
5111000061101 has 32 divisors (see below), whose sum is σ = 5739357326976. Its totient is φ = 4511771680000.
The previous prime is 5111000061001. The next prime is 5111000061107. The reversal of 5111000061101 is 1011600001115.
It is a cyclic number.
It is not a de Polignac number, because 5111000061101 - 210 = 5111000060077 is a prime.
It is a super-2 number, since 2×51110000611012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5111000061101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111000061107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 161382470 + ... + 161414136.
It is an arithmetic number, because the mean of its divisors is an integer number (179354916468).
Almost surely, 25111000061101 is an apocalyptic number.
It is an amenable number.
5111000061101 is a deficient number, since it is larger than the sum of its proper divisors (628357265875).
5111000061101 is a wasteful number, since it uses less digits than its factorization.
5111000061101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34573.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 5111000061101 its reverse (1011600001115), we get a palindrome (6122600062216).
The spelling of 5111000061101 in words is "five trillion, one hundred eleven billion, sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •