Base | Representation |
---|---|
bin | 100101001011111111111… |
… | …1101111110010100001011 |
3 | 200002121102010001102012222 |
4 | 1022113333331332110023 |
5 | 1132214322200113201 |
6 | 14511544341524255 |
7 | 1035154414606436 |
oct | 112277775762413 |
9 | 20077363042188 |
10 | 5111010551051 |
11 | 16a0627237629 |
12 | 6a666b11368b |
13 | 2b0c73a53972 |
14 | 139534c6281d |
15 | 8ce383d191b |
hex | 4a5fff7e50b |
5111010551051 has 4 divisors (see below), whose sum is σ = 5111023652112. Its totient is φ = 5110997449992.
The previous prime is 5111010551039. The next prime is 5111010551093. The reversal of 5111010551051 is 1501550101115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5111010551051 - 218 = 5111010288907 is a prime.
It is a super-2 number, since 2×51110105510512 (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 5111010551051.
It is not an unprimeable number, because it can be changed into a prime (5111010551351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5946800 + ... + 6751773.
It is an arithmetic number, because the mean of its divisors is an integer number (1277755913028).
Almost surely, 25111010551051 is an apocalyptic number.
5111010551051 is a deficient number, since it is larger than the sum of its proper divisors (13101061).
5111010551051 is a wasteful number, since it uses less digits than its factorization.
5111010551051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13101060.
The product of its (nonzero) digits is 625, while the sum is 26.
Adding to 5111010551051 its reverse (1501550101115), we get a palindrome (6612560652166).
The spelling of 5111010551051 in words is "five trillion, one hundred eleven billion, ten million, five hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •