Base | Representation |
---|---|
bin | 11100011000110001… |
… | …11001111101111101 |
3 | 1110100010012110102011 |
4 | 32030120321331331 |
5 | 222203000203041 |
6 | 11000135131221 |
7 | 1046444624365 |
oct | 161430717575 |
9 | 43303173364 |
10 | 15240241021 |
11 | 651079a715 |
12 | 2b53b13b11 |
13 | 158b5527c5 |
14 | a480bd9a5 |
15 | 5e2e6be81 |
hex | 38c639f7d |
15240241021 has 2 divisors, whose sum is σ = 15240241022. Its totient is φ = 15240241020.
The previous prime is 15240241019. The next prime is 15240241057. The reversal of 15240241021 is 12014204251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14936261796 + 303979225 = 122214^2 + 17435^2 .
It is a cyclic number.
It is not a de Polignac number, because 15240241021 - 21 = 15240241019 is a prime.
It is a super-2 number, since 2×152402410212 (a number of 21 digits) contains 22 as substring.
Together with 15240241019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 15240240983 and 15240241001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15240244021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7620120510 + 7620120511.
It is an arithmetic number, because the mean of its divisors is an integer number (7620120511).
Almost surely, 215240241021 is an apocalyptic number.
It is an amenable number.
15240241021 is a deficient number, since it is larger than the sum of its proper divisors (1).
15240241021 is an equidigital number, since it uses as much as digits as its factorization.
15240241021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 15240241021 its reverse (12014204251), we get a palindrome (27254445272).
The spelling of 15240241021 in words is "fifteen billion, two hundred forty million, two hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •