Base | Representation |
---|---|
bin | 10011111100001100… |
… | …100100000011100111 |
3 | 2001021011121120012221 |
4 | 103330030210003213 |
5 | 322322210133111 |
6 | 13500332253211 |
7 | 1355404450561 |
oct | 237414440347 |
9 | 61234546187 |
10 | 21411021031 |
11 | 9097a66004 |
12 | 4196611207 |
13 | 2032b1491a |
14 | 1071866331 |
15 | 854a8b371 |
hex | 4fc3240e7 |
21411021031 has 2 divisors, whose sum is σ = 21411021032. Its totient is φ = 21411021030.
The previous prime is 21411021013. The next prime is 21411021041. The reversal of 21411021031 is 13012011412.
Together with previous prime (21411021013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21411021031 - 213 = 21411012839 is a prime.
It is a super-2 number, since 2×214110210312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21411020996 and 21411021014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21411021041) 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 as a sum of consecutive naturals, namely, 10705510515 + 10705510516.
It is an arithmetic number, because the mean of its divisors is an integer number (10705510516).
Almost surely, 221411021031 is an apocalyptic number.
21411021031 is a deficient number, since it is larger than the sum of its proper divisors (1).
21411021031 is an equidigital number, since it uses as much as digits as its factorization.
21411021031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21411021031 its reverse (13012011412), we get a palindrome (34423032443).
The spelling of 21411021031 in words is "twenty-one billion, four hundred eleven million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •