Base | Representation |
---|---|
bin | 10010111000000101… |
… | …01001011001001101 |
3 | 222011021011021001101 |
4 | 21130002221121031 |
5 | 131223314213201 |
6 | 4353333343101 |
7 | 506063463136 |
oct | 113402513115 |
9 | 28137137041 |
10 | 10134132301 |
11 | 43304a9657 |
12 | 1b69a97a91 |
13 | c56721ab7 |
14 | 6c1cbac8d |
15 | 3e4a55d01 |
hex | 25c0a964d |
10134132301 has 2 divisors, whose sum is σ = 10134132302. Its totient is φ = 10134132300.
The previous prime is 10134132299. The next prime is 10134132311. The reversal of 10134132301 is 10323143101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7621115401 + 2513016900 = 87299^2 + 50130^2 .
It is an emirp because it is prime and its reverse (10323143101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10134132301 - 21 = 10134132299 is a prime.
Together with 10134132299, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10134132311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5067066150 + 5067066151.
It is an arithmetic number, because the mean of its divisors is an integer number (5067066151).
Almost surely, 210134132301 is an apocalyptic number.
It is an amenable number.
10134132301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10134132301 is an equidigital number, since it uses as much as digits as its factorization.
10134132301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10134132301 its reverse (10323143101), we get a palindrome (20457275402).
It can be divided in two parts, 1013 and 4132301, that added together give a palindrome (4133314).
The spelling of 10134132301 in words is "ten billion, one hundred thirty-four million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •