Base | Representation |
---|---|
bin | 1100001011111… |
… | …10111111010101 |
3 | 21010100220222011 |
4 | 12011332333111 |
5 | 202132411041 |
6 | 14051104221 |
7 | 2350646353 |
oct | 605767725 |
9 | 233326864 |
10 | 102232021 |
11 | 52786481 |
12 | 2a2a2071 |
13 | 18245728 |
14 | d8127d3 |
15 | 8e95e81 |
hex | 617efd5 |
102232021 has 2 divisors, whose sum is σ = 102232022. Its totient is φ = 102232020.
The previous prime is 102232019. The next prime is 102232043. The reversal of 102232021 is 120232201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54552996 + 47679025 = 7386^2 + 6905^2 .
It is a cyclic number.
It is not a de Polignac number, because 102232021 - 21 = 102232019 is a prime.
It is a super-2 number, since 2×1022320212 = 20902772235488882, which contains 22 as substring.
Together with 102232019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 102231992 and 102232010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102232001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116010 + 51116011.
It is an arithmetic number, because the mean of its divisors is an integer number (51116011).
Almost surely, 2102232021 is an apocalyptic number.
It is an amenable number.
102232021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102232021 is an equidigital number, since it uses as much as digits as its factorization.
102232021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 102232021 is about 10110.9851646613. The cubic root of 102232021 is about 467.5868785319.
Adding to 102232021 its reverse (120232201), we get a palindrome (222464222).
The spelling of 102232021 in words is "one hundred two million, two hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •