Base | Representation |
---|---|
bin | 10111001100011110000110… |
… | …01001001101010110100001 |
3 | 20200121010102120121101000000 |
4 | 23212033003021031112201 |
5 | 23141140302204023410 |
6 | 300251500544050213 |
7 | 13513030330501524 |
oct | 1346170311152641 |
9 | 220533376541000 |
10 | 51006010611105 |
11 | 152855892a2080 |
12 | 5879381903969 |
13 | 225cb00031324 |
14 | c849c0022bbb |
15 | 5d6bb3e07dc0 |
hex | 2e63c324d5a1 |
51006010611105 has 112 divisors (see below), whose sum is σ = 100157077244736. Its totient is φ = 24718918469760.
The previous prime is 51006010611053. The next prime is 51006010611109. The reversal of 51006010611105 is 50111601060015.
51006010611105 is a `hidden beast` number, since 51 + 0 + 0 + 601 + 0 + 6 + 1 + 1 + 1 + 0 + 5 = 666.
It is not a de Polignac number, because 51006010611105 - 27 = 51006010610977 is a prime.
It is a super-2 number, since 2×510060106111052 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51006010611109) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 88040559 + ... + 88618011.
Almost surely, 251006010611105 is an apocalyptic number.
51006010611105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
51006010611105 is a deficient number, since it is larger than the sum of its proper divisors (49151066633631).
51006010611105 is a wasteful number, since it uses less digits than its factorization.
51006010611105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 579690 (or 579675 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 51006010611105 in words is "fifty-one trillion, six billion, ten million, six hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •