Base | Representation |
---|---|
bin | 110001011101011101… |
… | …0011100111011001111 |
3 | 101011011022110010210201 |
4 | 1202322322130323033 |
5 | 3220012031200421 |
6 | 120443342114331 |
7 | 10450052311621 |
oct | 1427272347317 |
9 | 334138403721 |
10 | 106215100111 |
11 | 4105572287a |
12 | 1870327b9a7 |
13 | a02931b883 |
14 | 51d8662c11 |
15 | 2b69bb0b91 |
hex | 18bae9cecf |
106215100111 has 8 divisors (see below), whose sum is σ = 109881393120. Its totient is φ = 102549054048.
The previous prime is 106215100051. The next prime is 106215100133. The reversal of 106215100111 is 111001512601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106215100111 - 217 = 106214969039 is a prime.
It is a super-2 number, since 2×1062151001112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106215100141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1401390 + ... + 1475236.
It is an arithmetic number, because the mean of its divisors is an integer number (13735174140).
Almost surely, 2106215100111 is an apocalyptic number.
106215100111 is a deficient number, since it is larger than the sum of its proper divisors (3666293009).
106215100111 is an equidigital number, since it uses as much as digits as its factorization.
106215100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123473.
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 106215100111 its reverse (111001512601), we get a palindrome (217216612712).
The spelling of 106215100111 in words is "one hundred six billion, two hundred fifteen million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •