Base | Representation |
---|---|
bin | 11000001110000000101100… |
… | …010100000011000101011010 |
3 | 111222010211020110200020222101 |
4 | 120032000230110003011122 |
5 | 102430124112143100233 |
6 | 1014312424355314014 |
7 | 31302344046506623 |
oct | 3016005424030532 |
9 | 458124213606871 |
10 | 106515932393818 |
11 | 30a37175a76342 |
12 | bb436022ab90a |
13 | 475854239896c |
14 | 1c43581bd8a4a |
15 | c4aacce79c7d |
hex | 60e02c50315a |
106515932393818 has 16 divisors (see below), whose sum is σ = 162322020935424. Its totient is φ = 52414907131600.
The previous prime is 106515932393737. The next prime is 106515932393833. The reversal of 106515932393818 is 818393239515601.
106515932393818 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1065159323938182 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106515932393818.
It is an unprimeable number.
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, 1578728530 + ... + 1578795997.
It is an arithmetic number, because the mean of its divisors is an integer number (10145126308464).
Almost surely, 2106515932393818 is an apocalyptic number.
106515932393818 is a deficient number, since it is larger than the sum of its proper divisors (55806088541606).
106515932393818 is a wasteful number, since it uses less digits than its factorization.
106515932393818 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3157524797.
The product of its (nonzero) digits is 41990400, while the sum is 64.
The spelling of 106515932393818 in words is "one hundred six trillion, five hundred fifteen billion, nine hundred thirty-two million, three hundred ninety-three thousand, eight hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •