Base | Representation |
---|---|
bin | 110000111010110100… |
… | …1111000110110011101 |
3 | 101001011022222221122220 |
4 | 1201311221320312131 |
5 | 3210122100131031 |
6 | 120132153055553 |
7 | 10406212605231 |
oct | 1416551706635 |
9 | 331138887586 |
10 | 105053130141 |
11 | 40609831613 |
12 | 1843a0b75b9 |
13 | 9ba268138b |
14 | 51281d25c1 |
15 | 2aecb88596 |
hex | 1875a78d9d |
105053130141 has 8 divisors (see below), whose sum is σ = 144900869280. Its totient is φ = 67620405552.
The previous prime is 105053130059. The next prime is 105053130163. The reversal of 105053130141 is 141031350501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105053130141 - 213 = 105053121949 is a prime.
It is a super-2 number, since 2×1050531301412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105053130541) 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, 603753535 + ... + 603753708.
It is an arithmetic number, because the mean of its divisors is an integer number (18112608660).
Almost surely, 2105053130141 is an apocalyptic number.
It is an amenable number.
105053130141 is a deficient number, since it is larger than the sum of its proper divisors (39847739139).
105053130141 is a wasteful number, since it uses less digits than its factorization.
105053130141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207507275.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 105053130141 its reverse (141031350501), we get a palindrome (246084480642).
The spelling of 105053130141 in words is "one hundred five billion, fifty-three million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •