Base | Representation |
---|---|
bin | 1110101011101010110… |
… | …0100000010110111101 |
3 | 220010002001200112011201 |
4 | 3222322230200112331 |
5 | 13113042011112341 |
6 | 311513321415501 |
7 | 24136515306403 |
oct | 3527254402675 |
9 | 803061615151 |
10 | 252240332221 |
11 | 97a7a100a89 |
12 | 40a7693a591 |
13 | 1aa2b272367 |
14 | c2cc18b473 |
15 | 6864851331 |
hex | 3abab205bd |
252240332221 has 4 divisors (see below), whose sum is σ = 265516139200. Its totient is φ = 238964525244.
The previous prime is 252240332219. The next prime is 252240332237. The reversal of 252240332221 is 122233042252.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 252240332221 - 21 = 252240332219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 252240332221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252240332261) 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, 6637903461 + ... + 6637903498.
It is an arithmetic number, because the mean of its divisors is an integer number (66379034800).
Almost surely, 2252240332221 is an apocalyptic number.
It is an amenable number.
252240332221 is a deficient number, since it is larger than the sum of its proper divisors (13275806979).
252240332221 is a wasteful number, since it uses less digits than its factorization.
252240332221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13275806978.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 252240332221 its reverse (122233042252), we get a palindrome (374473374473).
The spelling of 252240332221 in words is "two hundred fifty-two billion, two hundred forty million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •