Base | Representation |
---|---|
bin | 10011100100111001… |
… | …00000011011001101 |
3 | 1000010110102211101220 |
4 | 21302130200123031 |
5 | 133011030310221 |
6 | 4454521553553 |
7 | 521306416515 |
oct | 116234403315 |
9 | 30113384356 |
10 | 10510010061 |
11 | 4503699131 |
12 | 20539458b9 |
13 | cb6568885 |
14 | 719ba2845 |
15 | 417a520c6 |
hex | 2727206cd |
10510010061 has 4 divisors (see below), whose sum is σ = 14013346752. Its totient is φ = 7006673372.
The previous prime is 10510010059. The next prime is 10510010101. The reversal of 10510010061 is 16001001501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10510010061 - 21 = 10510010059 is a prime.
It is a super-2 number, since 2×105100100612 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10510010061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10510020061) 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, 1751668341 + ... + 1751668346.
It is an arithmetic number, because the mean of its divisors is an integer number (3503336688).
Almost surely, 210510010061 is an apocalyptic number.
It is an amenable number.
10510010061 is a deficient number, since it is larger than the sum of its proper divisors (3503336691).
10510010061 is an equidigital number, since it uses as much as digits as its factorization.
10510010061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3503336690.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 10510010061 its reverse (16001001501), we get a palindrome (26511011562).
The spelling of 10510010061 in words is "ten billion, five hundred ten million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •