Base | Representation |
---|---|
bin | 11000010111001000111110… |
… | …111100000111110001111111 |
3 | 112001100210121111112121001222 |
4 | 120113020332330013301333 |
5 | 103020413444342121134 |
6 | 1015512542425223555 |
7 | 31365564051236612 |
oct | 3027107674076177 |
9 | 461323544477058 |
10 | 107143310113919 |
11 | 3115924a3801a2 |
12 | 10025111931bbb |
13 | 47a2756047241 |
14 | 1c65a9a126179 |
15 | c5c09b5dea2e |
hex | 61723ef07c7f |
107143310113919 has 16 divisors (see below), whose sum is σ = 108644808088128. Its totient is φ = 105642731077632.
The previous prime is 107143310113837. The next prime is 107143310113921. The reversal of 107143310113919 is 919311013341701.
It is a cyclic number.
It is not a de Polignac number, because 107143310113919 - 28 = 107143310113663 is a prime.
It is a super-2 number, since 2×1071433101139192 (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 107143310113919.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107143310113969) 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, 4195597919 + ... + 4195623455.
It is an arithmetic number, because the mean of its divisors is an integer number (6790300505508).
Almost surely, 2107143310113919 is an apocalyptic number.
107143310113919 is a deficient number, since it is larger than the sum of its proper divisors (1501497974209).
107143310113919 is an equidigital number, since it uses as much as digits as its factorization.
107143310113919 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41234.
The product of its (nonzero) digits is 61236, while the sum is 44.
The spelling of 107143310113919 in words is "one hundred seven trillion, one hundred forty-three billion, three hundred ten million, one hundred thirteen thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •