Base | Representation |
---|---|
bin | 10011100110001110… |
… | …10000010010000011 |
3 | 1000011020112011020112 |
4 | 21303013100102003 |
5 | 133021412404011 |
6 | 4500002101535 |
7 | 521503601336 |
oct | 116307202203 |
9 | 30136464215 |
10 | 10521216131 |
11 | 4509a52448 |
12 | 205764a8ab |
13 | cb899039a |
14 | 71b47c61d |
15 | 418a1758b |
hex | 2731d0483 |
10521216131 has 4 divisors (see below), whose sum is σ = 10521457632. Its totient is φ = 10520974632.
The previous prime is 10521216109. The next prime is 10521216143. The reversal of 10521216131 is 13161212501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13161212501 = 131 ⋅100467271.
It is a cyclic number.
It is not a de Polignac number, because 10521216131 - 214 = 10521199747 is a prime.
It is a super-2 number, since 2×105212161312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10521216097 and 10521216106.
It is not an unprimeable number, because it can be changed into a prime (10521216151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35195 + ... + 149268.
It is an arithmetic number, because the mean of its divisors is an integer number (2630364408).
Almost surely, 210521216131 is an apocalyptic number.
10521216131 is a deficient number, since it is larger than the sum of its proper divisors (241501).
10521216131 is an equidigital number, since it uses as much as digits as its factorization.
10521216131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241500.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 10521216131 its reverse (13161212501), we get a palindrome (23682428632).
The spelling of 10521216131 in words is "ten billion, five hundred twenty-one million, two hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •