Base | Representation |
---|---|
bin | 11111100110101… |
… | …000110000010101 |
3 | 1100221201001222121 |
4 | 133212220300111 |
5 | 2041214101401 |
6 | 124340255541 |
7 | 16065546013 |
oct | 3746506025 |
9 | 1327631877 |
10 | 530222101 |
11 | 252329792 |
12 | 1296a15b1 |
13 | 85b071b6 |
14 | 505c18b3 |
15 | 31837ca1 |
hex | 1f9a8c15 |
530222101 has 2 divisors, whose sum is σ = 530222102. Its totient is φ = 530222100.
The previous prime is 530222083. The next prime is 530222117. The reversal of 530222101 is 101222035.
It is an a-pointer prime, because the next prime (530222117) can be obtained adding 530222101 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 360962001 + 169260100 = 18999^2 + 13010^2 .
It is a cyclic number.
It is not a de Polignac number, because 530222101 - 27 = 530221973 is a prime.
It is a super-2 number, since 2×5302221012 = 562270952777708402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530222131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265111050 + 265111051.
It is an arithmetic number, because the mean of its divisors is an integer number (265111051).
Almost surely, 2530222101 is an apocalyptic number.
It is an amenable number.
530222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
530222101 is an equidigital number, since it uses as much as digits as its factorization.
530222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 530222101 is about 23026.5520866673. The cubic root of 530222101 is about 809.3802611048.
Adding to 530222101 its reverse (101222035), we get a palindrome (631444136).
The spelling of 530222101 in words is "five hundred thirty million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •