Base | Representation |
---|---|
bin | 1110101011111001100… |
… | …0001101100100011001 |
3 | 220010020100221201202221 |
4 | 3222332120031210121 |
5 | 13113203320334431 |
6 | 311523410024041 |
7 | 24141165434332 |
oct | 3527630154431 |
9 | 803210851687 |
10 | 252302121241 |
11 | 98000a73a95 |
12 | 40a93578021 |
13 | 1aa3acc7701 |
14 | c2d6473289 |
15 | 6869ea9111 |
hex | 3abe60d919 |
252302121241 has 4 divisors (see below), whose sum is σ = 252303196084. Its totient is φ = 252301046400.
The previous prime is 252302121217. The next prime is 252302121257. The reversal of 252302121241 is 142121203252.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 123992015625 + 128310105616 = 352125^2 + 358204^2 .
It is a cyclic number.
It is not a de Polignac number, because 252302121241 - 215 = 252302088473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (252302721241) 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, 17940 + ... + 710581.
It is an arithmetic number, because the mean of its divisors is an integer number (63075799021).
Almost surely, 2252302121241 is an apocalyptic number.
It is an amenable number.
252302121241 is a deficient number, since it is larger than the sum of its proper divisors (1074843).
252302121241 is an equidigital number, since it uses as much as digits as its factorization.
252302121241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1074842.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 252302121241 its reverse (142121203252), we get a palindrome (394423324493).
The spelling of 252302121241 in words is "two hundred fifty-two billion, three hundred two million, one hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •