Base | Representation |
---|---|
bin | 110001011101000101… |
… | …0110111100000000011 |
3 | 101011010102222101121111 |
4 | 1202322022313200003 |
5 | 3220000333013201 |
6 | 120442214504151 |
7 | 10446541266244 |
oct | 1427212674003 |
9 | 334112871544 |
10 | 106202626051 |
11 | 41049682935 |
12 | 186bb065057 |
13 | a026871b82 |
14 | 51d6b36ccb |
15 | 2b68a49b51 |
hex | 18ba2b7803 |
106202626051 has 8 divisors (see below), whose sum is σ = 110253008880. Its totient is φ = 102178124832.
The previous prime is 106202626021. The next prime is 106202626067. The reversal of 106202626051 is 150626202601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106202626051 is a prime.
It is a super-2 number, since 2×1062026260512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106202626021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6462040 + ... + 6478453.
It is an arithmetic number, because the mean of its divisors is an integer number (13781626110).
Almost surely, 2106202626051 is an apocalyptic number.
106202626051 is a deficient number, since it is larger than the sum of its proper divisors (4050382829).
106202626051 is a wasteful number, since it uses less digits than its factorization.
106202626051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12940805.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 106202626051 its reverse (150626202601), we get a palindrome (256828828652).
The spelling of 106202626051 in words is "one hundred six billion, two hundred two million, six hundred twenty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •