Base | Representation |
---|---|
bin | 110001000011011101… |
… | …0001000100110110101 |
3 | 101001220111200121221000 |
4 | 1202012322020212311 |
5 | 3211220201223103 |
6 | 120221013313513 |
7 | 10416326224422 |
oct | 1420672104665 |
9 | 331814617830 |
10 | 105342601653 |
11 | 40748174873 |
12 | 184bb035899 |
13 | 9c1a633bb3 |
14 | 5154824d49 |
15 | 2b182b7aa3 |
hex | 1886e889b5 |
105342601653 has 8 divisors (see below), whose sum is σ = 156063113600. Its totient is φ = 70228401084.
The previous prime is 105342601633. The next prime is 105342601699. The reversal of 105342601653 is 356106243501.
105342601653 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 42 + 601 + 6 + 5 + 3 = 666.
It is not a de Polignac number, because 105342601653 - 26 = 105342601589 is a prime.
It is a super-2 number, since 2×1053426016532 (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 (105342601613) by changing a digit.
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, 1950788893 + ... + 1950788946.
It is an arithmetic number, because the mean of its divisors is an integer number (19507889200).
Almost surely, 2105342601653 is an apocalyptic number.
It is an amenable number.
105342601653 is a deficient number, since it is larger than the sum of its proper divisors (50720511947).
105342601653 is an equidigital number, since it uses as much as digits as its factorization.
105342601653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3901577848 (or 3901577842 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 105342601653 in words is "one hundred five billion, three hundred forty-two million, six hundred one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •