Base | Representation |
---|---|
bin | 1110101100000000011… |
… | …1100111000000011101 |
3 | 220010022101220100122011 |
4 | 3223000013213000131 |
5 | 13113233304322141 |
6 | 311530331551221 |
7 | 24142001601022 |
oct | 3530007470035 |
9 | 803271810564 |
10 | 252331323421 |
11 | 980164aa021 |
12 | 40aa12bb511 |
13 | 1aa440804c8 |
14 | c2da2b5549 |
15 | 686c826881 |
hex | 3ac01e701d |
252331323421 has 4 divisors (see below), whose sum is σ = 252469740672. Its totient is φ = 252192906172.
The previous prime is 252331323347. The next prime is 252331323473. The reversal of 252331323421 is 124323133252.
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 a cyclic number.
It is not a de Polignac number, because 252331323421 - 233 = 243741388829 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 (252331323521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69205891 + ... + 69209536.
It is an arithmetic number, because the mean of its divisors is an integer number (63117435168).
Almost surely, 2252331323421 is an apocalyptic number.
It is an amenable number.
252331323421 is a deficient number, since it is larger than the sum of its proper divisors (138417251).
252331323421 is a wasteful number, since it uses less digits than its factorization.
252331323421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138417250.
The product of its digits is 25920, while the sum is 31.
Adding to 252331323421 its reverse (124323133252), we get a palindrome (376654456673).
The spelling of 252331323421 in words is "two hundred fifty-two billion, three hundred thirty-one million, three hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •