Base | Representation |
---|---|
bin | 11000001100100011111001… |
… | …111001111100011010000111 |
3 | 111221210022002002100022120022 |
4 | 120030203321321330122013 |
5 | 102422011041411121434 |
6 | 1014154550251525355 |
7 | 31262216115055265 |
oct | 3014437171743207 |
9 | 457708062308508 |
10 | 106416302442119 |
11 | 309a899a508a8a |
12 | bb2823845985b |
13 | 474c025441817 |
14 | 1c3c80dd83435 |
15 | c481eb48922e |
hex | 60c8f9e7c687 |
106416302442119 has 32 divisors (see below), whose sum is σ = 113873400837504. Its totient is φ = 99200422379520.
The previous prime is 106416302442083. The next prime is 106416302442193. The reversal of 106416302442119 is 911244203614601.
It is a cyclic number.
It is not a de Polignac number, because 106416302442119 - 232 = 106412007474823 is a prime.
It is a super-2 number, since 2×1064163024421192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106416302442119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106416302444119) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9256000379 + ... + 9256011875.
It is an arithmetic number, because the mean of its divisors is an integer number (3558543776172).
Almost surely, 2106416302442119 is an apocalyptic number.
106416302442119 is a deficient number, since it is larger than the sum of its proper divisors (7457098395385).
106416302442119 is a wasteful number, since it uses less digits than its factorization.
106416302442119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21227.
The product of its (nonzero) digits is 248832, while the sum is 44.
The spelling of 106416302442119 in words is "one hundred six trillion, four hundred sixteen billion, three hundred two million, four hundred forty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •