Base | Representation |
---|---|
bin | 10110110110100011001001… |
… | …001100000100100001001011 |
3 | 111011212020112202221102010000 |
4 | 112312203021030010201023 |
5 | 101133140442142023201 |
6 | 553431350114054043 |
7 | 30112201466156535 |
oct | 2666431114044113 |
9 | 434766482842100 |
10 | 100505610111051 |
11 | 2a02a20a806092 |
12 | b3327b157a323 |
13 | 441083b64b452 |
14 | 1ab66d7152855 |
15 | b945acbc2d86 |
hex | 5b68c930484b |
100505610111051 has 40 divisors (see below), whose sum is σ = 152387770201920. Its totient is φ = 66006711648432.
The previous prime is 100505610111041. The next prime is 100505610111077. The reversal of 100505610111051 is 150111016505001.
100505610111051 is a `hidden beast` number, since 1 + 0 + 0 + 50 + 561 + 0 + 1 + 1 + 1 + 0 + 51 = 666.
It is not a de Polignac number, because 100505610111051 - 29 = 100505610110539 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (100505610111041) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 30840661 + ... + 33943446.
It is an arithmetic number, because the mean of its divisors is an integer number (3809694255048).
Almost surely, 2100505610111051 is an apocalyptic number.
100505610111051 is a deficient number, since it is larger than the sum of its proper divisors (51882160090869).
100505610111051 is a wasteful number, since it uses less digits than its factorization.
100505610111051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64784405 (or 64784396 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
Adding to 100505610111051 its reverse (150111016505001), we get a palindrome (250616626616052).
The spelling of 100505610111051 in words is "one hundred trillion, five hundred five billion, six hundred ten million, one hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •