Base | Representation |
---|---|
bin | 101101111011011… |
… | …1000100011110101 |
3 | 10222101212201010001 |
4 | 1123312320203311 |
5 | 11124011122401 |
6 | 412531231301 |
7 | 53122153012 |
oct | 13366704365 |
9 | 3871781101 |
10 | 1541114101 |
11 | 720a1191a |
12 | 370148531 |
13 | 1b7388c47 |
14 | 108966709 |
15 | 9046b601 |
hex | 5bdb88f5 |
1541114101 has 6 divisors (see below), whose sum is σ = 1564463670. Its totient is φ = 1518107976.
The previous prime is 1541114083. The next prime is 1541114177. The reversal of 1541114101 is 1014111451.
It can be written as a sum of positive squares in only one way, i.e., 1343149201 + 197964900 = 36649^2 + 14070^2 .
It is not a de Polignac number, because 1541114101 - 29 = 1541113589 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 (1541114401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 167166 + ... + 176143.
It is an arithmetic number, because the mean of its divisors is an integer number (260743945).
Almost surely, 21541114101 is an apocalyptic number.
It is an amenable number.
1541114101 is a deficient number, since it is larger than the sum of its proper divisors (23349569).
1541114101 is an frugal number, since it uses more digits than its factorization.
1541114101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343443 (or 343376 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 19.
The square root of 1541114101 is about 39257.0261354576. The cubic root of 1541114101 is about 1155.0787602695.
Adding to 1541114101 its reverse (1014111451), we get a palindrome (2555225552).
The spelling of 1541114101 in words is "one billion, five hundred forty-one million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •