Base | Representation |
---|---|
bin | 11100011010100100… |
… | …00011001110010101 |
3 | 1110101011101112021102 |
4 | 32031102003032111 |
5 | 222220314034031 |
6 | 11001432155445 |
7 | 1050016145246 |
oct | 161522031625 |
9 | 43334345242 |
10 | 15255221141 |
11 | 65191a1486 |
12 | 2b58b38b85 |
13 | 1591699094 |
14 | a4a09cccd |
15 | 5e442a7cb |
hex | 38d483395 |
15255221141 has 4 divisors (see below), whose sum is σ = 15390223212. Its totient is φ = 15120219072.
The previous prime is 15255221057. The next prime is 15255221171. The reversal of 15255221141 is 14112255251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14112255251 = 53 ⋅266268967.
It can be written as a sum of positive squares in 2 ways, for example, as 3520048900 + 11735172241 = 59330^2 + 108329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15255221141 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 (15255221171) 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, 67500866 + ... + 67501091.
It is an arithmetic number, because the mean of its divisors is an integer number (3847555803).
Almost surely, 215255221141 is an apocalyptic number.
It is an amenable number.
15255221141 is a deficient number, since it is larger than the sum of its proper divisors (135002071).
15255221141 is a wasteful number, since it uses less digits than its factorization.
15255221141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135002070.
The product of its digits is 4000, while the sum is 29.
Adding to 15255221141 its reverse (14112255251), we get a palindrome (29367476392).
The spelling of 15255221141 in words is "fifteen billion, two hundred fifty-five million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •