Base | Representation |
---|---|
bin | 1001100011110001001101… |
… | …1010001011111011111011 |
3 | 1101012202102200022220210122 |
4 | 2120330103122023323323 |
5 | 2334144201303330201 |
6 | 34204140025403455 |
7 | 2133221224060421 |
oct | 230742332137373 |
9 | 41182380286718 |
10 | 10510110605051 |
11 | 3392349490762 |
12 | 1218b1a93958b |
13 | 5b3139b7b325 |
14 | 284999067111 |
15 | 1335d34d0e1b |
hex | 98f1368befb |
10510110605051 has 2 divisors, whose sum is σ = 10510110605052. Its totient is φ = 10510110605050.
The previous prime is 10510110605047. The next prime is 10510110605053. The reversal of 10510110605051 is 15050601101501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10510110605051 - 22 = 10510110605047 is a prime.
It is a super-2 number, since 2×105101106050512 (a number of 27 digits) contains 22 as substring.
Together with 10510110605053, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10510110605051.
It is not a weakly prime, because it can be changed into another prime (10510110605053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5255055302525 + 5255055302526.
It is an arithmetic number, because the mean of its divisors is an integer number (5255055302526).
Almost surely, 210510110605051 is an apocalyptic number.
10510110605051 is a deficient number, since it is larger than the sum of its proper divisors (1).
10510110605051 is an equidigital number, since it uses as much as digits as its factorization.
10510110605051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 10510110605051 its reverse (15050601101501), we get a palindrome (25560711706552).
The spelling of 10510110605051 in words is "ten trillion, five hundred ten billion, one hundred ten million, six hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •