Base | Representation |
---|---|
bin | 11000001011000100110101… |
… | …011010100001001101111111 |
3 | 111221102112120220021100221002 |
4 | 120023010311122201031333 |
5 | 102413323011213402033 |
6 | 1014040025033400515 |
7 | 31251643343315243 |
oct | 3013046532411577 |
9 | 457375526240832 |
10 | 106314221622143 |
11 | 30969676555057 |
12 | bb104a986913b |
13 | 47425077cb372 |
14 | 1c378c882a423 |
15 | c457247253e8 |
hex | 60b1356a137f |
106314221622143 has 16 divisors (see below), whose sum is σ = 115979740169760. Its totient is φ = 97045065501696.
The previous prime is 106314221622121. The next prime is 106314221622179. The reversal of 106314221622143 is 341226122413601.
It is a cyclic number.
It is not a de Polignac number, because 106314221622143 - 236 = 106245502145407 is a prime.
It is a super-2 number, since 2×1063142216221432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106314221622097 and 106314221622106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106314221622643) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 269804753 + ... + 270198506.
It is an arithmetic number, because the mean of its divisors is an integer number (7248733760610).
Almost surely, 2106314221622143 is an apocalyptic number.
106314221622143 is a deficient number, since it is larger than the sum of its proper divisors (9665518547617).
106314221622143 is a wasteful number, since it uses less digits than its factorization.
106314221622143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540003626.
The product of its (nonzero) digits is 82944, while the sum is 38.
The spelling of 106314221622143 in words is "one hundred six trillion, three hundred fourteen billion, two hundred twenty-one million, six hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •