Base | Representation |
---|---|
bin | 10110110111111111110000… |
… | …010011000100101101000011 |
3 | 111012012202012221120212121121 |
4 | 112313333300103010231003 |
5 | 101141303120412143201 |
6 | 553545153330533111 |
7 | 30122321636450560 |
oct | 2667776023045503 |
9 | 435182187525547 |
10 | 100605050506051 |
11 | 2a0683a9273713 |
12 | b349b23a37197 |
13 | 441a028236870 |
14 | 1abb44bb43867 |
15 | b96e7cc1d9a1 |
hex | 5b7ff04c4b43 |
100605050506051 has 16 divisors (see below), whose sum is σ = 123821843108544. Its totient is φ = 79599444516864.
The previous prime is 100605050505977. The next prime is 100605050506057. The reversal of 100605050506051 is 150605050506001.
It is a cyclic number.
It is not a de Polignac number, because 100605050506051 - 215 = 100605050473283 is a prime.
It is a super-2 number, since 2×1006050505060512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100605050505998 and 100605050506016.
It is not an unprimeable number, because it can be changed into a prime (100605050506057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74406531 + ... + 75746563.
It is an arithmetic number, because the mean of its divisors is an integer number (7738865194284).
Almost surely, 2100605050506051 is an apocalyptic number.
100605050506051 is a deficient number, since it is larger than the sum of its proper divisors (23216792602493).
100605050506051 is a wasteful number, since it uses less digits than its factorization.
100605050506051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2165070.
The product of its (nonzero) digits is 22500, while the sum is 34.
It can be divided in two parts, 100605050 and 506051, that added together give a palindrome (101111101).
The spelling of 100605050506051 in words is "one hundred trillion, six hundred five billion, fifty million, five hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •