Base | Representation |
---|---|
bin | 1000001101101010001… |
… | …1001001100000010111 |
3 | 111111012220002012120011 |
4 | 2003122203021200113 |
5 | 4302441013204120 |
6 | 144453434421051 |
7 | 13123504546324 |
oct | 2033243114027 |
9 | 444186065504 |
10 | 141105600535 |
11 | 5492a484199 |
12 | 2341bb91787 |
13 | 103c9953bb3 |
14 | 6b883c7b4b |
15 | 3a0cd11c5a |
hex | 20da8c9817 |
141105600535 has 4 divisors (see below), whose sum is σ = 169326720648. Its totient is φ = 112884480424.
The previous prime is 141105600491. The next prime is 141105600539. The reversal of 141105600535 is 535006501141.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141105600535 - 213 = 141105592343 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141105600497 and 141105600506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141105600539) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14110560049 + ... + 14110560058.
It is an arithmetic number, because the mean of its divisors is an integer number (42331680162).
Almost surely, 2141105600535 is an apocalyptic number.
141105600535 is a deficient number, since it is larger than the sum of its proper divisors (28221120113).
141105600535 is an equidigital number, since it uses as much as digits as its factorization.
141105600535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28221120112.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 141105600535 in words is "one hundred forty-one billion, one hundred five million, six hundred thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •