Base | Representation |
---|---|
bin | 110001100011011011… |
… | …1000101000110000110 |
3 | 101011200021121200021220 |
4 | 1203012313011012012 |
5 | 3220414334331122 |
6 | 120515302221210 |
7 | 10455035121342 |
oct | 1430667050606 |
9 | 334607550256 |
10 | 106415542662 |
11 | 41148888280 |
12 | 1875a424806 |
13 | a05b9cc430 |
14 | 521711c622 |
15 | 2b7c5a625c |
hex | 18c6dc5186 |
106415542662 has 64 divisors (see below), whose sum is σ = 250253418240. Its totient is φ = 29741097600.
The previous prime is 106415542657. The next prime is 106415542669. The reversal of 106415542662 is 266245514601.
It is a super-2 number, since 2×1064155426622 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106415542669) 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 31 ways as a sum of consecutive naturals, for example, 960789 + ... + 1065807.
It is an arithmetic number, because the mean of its divisors is an integer number (3910209660).
Almost surely, 2106415542662 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106415542662, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125126709120).
106415542662 is an abundant number, since it is smaller than the sum of its proper divisors (143837875578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106415542662 is a wasteful number, since it uses less digits than its factorization.
106415542662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106229.
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 106415542662 in words is "one hundred six billion, four hundred fifteen million, five hundred forty-two thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •