Base | Representation |
---|---|
bin | 111100110001111001… |
… | …0000111011111010101 |
3 | 110110220101020112111011 |
4 | 1321203302013133111 |
5 | 4114302403214031 |
6 | 135543403012221 |
7 | 12300325024366 |
oct | 1714362073725 |
9 | 413811215434 |
10 | 130523101141 |
11 | 50399984824 |
12 | 21367b0a071 |
13 | c401387734 |
14 | 6462b55b6d |
15 | 35ddc416b1 |
hex | 1e63c877d5 |
130523101141 has 4 divisors (see below), whose sum is σ = 130740278284. Its totient is φ = 130305924000.
The previous prime is 130523101123. The next prime is 130523101147. The reversal of 130523101141 is 141101325031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66288226225 + 64234874916 = 257465^2 + 253446^2 .
It is a cyclic number.
It is not a de Polignac number, because 130523101141 - 211 = 130523099093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130523101147) 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, 108587670 + ... + 108588871.
It is an arithmetic number, because the mean of its divisors is an integer number (32685069571).
Almost surely, 2130523101141 is an apocalyptic number.
It is an amenable number.
130523101141 is a deficient number, since it is larger than the sum of its proper divisors (217177143).
130523101141 is an equidigital number, since it uses as much as digits as its factorization.
130523101141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217177142.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 130523101141 its reverse (141101325031), we get a palindrome (271624426172).
The spelling of 130523101141 in words is "one hundred thirty billion, five hundred twenty-three million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •