Base | Representation |
---|---|
bin | 110000111111101010… |
… | …0100100110011000111 |
3 | 101001120122011210122211 |
4 | 1201333110210303013 |
5 | 3210440110041033 |
6 | 120200225204251 |
7 | 10413222264631 |
oct | 1417724446307 |
9 | 331518153584 |
10 | 105215315143 |
11 | 40692336604 |
12 | 18484490687 |
13 | 9bca158533 |
14 | 514196da51 |
15 | 2b0c0232cd |
hex | 187f524cc7 |
105215315143 has 8 divisors (see below), whose sum is σ = 105308517600. Its totient is φ = 105122148768.
The previous prime is 105215315131. The next prime is 105215315147. The reversal of 105215315143 is 341513512501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105215315143 is a prime.
It is a super-2 number, since 2×1052153151432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105215315147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11826805 + ... + 11835697.
It is an arithmetic number, because the mean of its divisors is an integer number (13163564700).
Almost surely, 2105215315143 is an apocalyptic number.
105215315143 is a deficient number, since it is larger than the sum of its proper divisors (93202457).
105215315143 is an equidigital number, since it uses as much as digits as its factorization.
105215315143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18041.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 105215315143 its reverse (341513512501), we get a palindrome (446728827644).
The spelling of 105215315143 in words is "one hundred five billion, two hundred fifteen million, three hundred fifteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •