Base | Representation |
---|---|
bin | 10011100110001110… |
… | …01111110001100011 |
3 | 1000011020112001101111 |
4 | 21303013033301203 |
5 | 133021412322201 |
6 | 4500002044151 |
7 | 521503562305 |
oct | 116307176143 |
9 | 30136461344 |
10 | 10521214051 |
11 | 4509a50927 |
12 | 2057649657 |
13 | cb898c45a |
14 | 71b47b975 |
15 | 418a16b51 |
hex | 2731cfc63 |
10521214051 has 2 divisors, whose sum is σ = 10521214052. Its totient is φ = 10521214050.
The previous prime is 10521214049. The next prime is 10521214061. The reversal of 10521214051 is 15041212501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10521214051 - 21 = 10521214049 is a prime.
It is a super-2 number, since 2×105212140512 (a number of 21 digits) contains 22 as substring.
Together with 10521214049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10521214061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5260607025 + 5260607026.
It is an arithmetic number, because the mean of its divisors is an integer number (5260607026).
Almost surely, 210521214051 is an apocalyptic number.
10521214051 is a deficient number, since it is larger than the sum of its proper divisors (1).
10521214051 is an equidigital number, since it uses as much as digits as its factorization.
10521214051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 400, while the sum is 22.
Adding to 10521214051 its reverse (15041212501), we get a palindrome (25562426552).
The spelling of 10521214051 in words is "ten billion, five hundred twenty-one million, two hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •