Base | Representation |
---|---|
bin | 10111001111101011001111… |
… | …11101101000111110011111 |
3 | 20200222122201101022010010210 |
4 | 23213311213331220332133 |
5 | 23144441333400022232 |
6 | 300414233553303503 |
7 | 13524006564043260 |
oct | 1347654775507637 |
9 | 220878641263123 |
10 | 51116150001567 |
11 | 15318268098312 |
12 | 589679b264b93 |
13 | 226a303383ca1 |
14 | c8a06b92c967 |
15 | 5d99ad3865cc |
hex | 2e7d67f68f9f |
51116150001567 has 64 divisors (see below), whose sum is σ = 84876569395200. Its totient is φ = 26699275209600.
The previous prime is 51116150001487. The next prime is 51116150001589. The reversal of 51116150001567 is 76510005161115.
It is not a de Polignac number, because 51116150001567 - 230 = 51115076259743 is a prime.
It is a super-2 number, since 2×511161500015672 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51116150001667) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15267258 + ... + 18311784.
It is an arithmetic number, because the mean of its divisors is an integer number (1326196396800).
Almost surely, 251116150001567 is an apocalyptic number.
51116150001567 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
51116150001567 is a deficient number, since it is larger than the sum of its proper divisors (33760419393633).
51116150001567 is a wasteful number, since it uses less digits than its factorization.
51116150001567 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3046036.
The product of its (nonzero) digits is 31500, while the sum is 39.
The spelling of 51116150001567 in words is "fifty-one trillion, one hundred sixteen billion, one hundred fifty million, one thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •