Base | Representation |
---|---|
bin | 101111100111000100… |
… | …010101000101110011 |
3 | 11212221201202201200012 |
4 | 233213010111011303 |
5 | 1314144023441430 |
6 | 35252415045135 |
7 | 3456555661166 |
oct | 574704250563 |
9 | 155851681605 |
10 | 51121312115 |
11 | 1a753714485 |
12 | 9aa85107ab |
13 | 4a89173113 |
14 | 268d619add |
15 | 14e303a695 |
hex | be7115173 |
51121312115 has 4 divisors (see below), whose sum is σ = 61345574544. Its totient is φ = 40897049688.
The previous prime is 51121312097. The next prime is 51121312129.
51121312115 is nontrivially palindromic in base 10.
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 51121312115 - 218 = 51121049971 is a prime.
It is a super-2 number, since 2×511213121152 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5112131207 + ... + 5112131216.
It is an arithmetic number, because the mean of its divisors is an integer number (15336393636).
Almost surely, 251121312115 is an apocalyptic number.
51121312115 is a deficient number, since it is larger than the sum of its proper divisors (10224262429).
51121312115 is a wasteful number, since it uses less digits than its factorization.
51121312115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10224262428.
The product of its digits is 300, while the sum is 23.
The spelling of 51121312115 in words is "fifty-one billion, one hundred twenty-one million, three hundred twelve thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •