Base | Representation |
---|---|
bin | 10010101010101000… |
… | …01111100000010101 |
3 | 221212101212000012001 |
4 | 21111110033200111 |
5 | 131010423214331 |
6 | 4334223155301 |
7 | 503223452506 |
oct | 112524174025 |
9 | 27771760161 |
10 | 10021304341 |
11 | 4282846304 |
12 | 1b38145b31 |
13 | c392394a9 |
14 | 6b0d0abad |
15 | 3d9bba561 |
hex | 25550f815 |
10021304341 has 2 divisors, whose sum is σ = 10021304342. Its totient is φ = 10021304340.
The previous prime is 10021304339. The next prime is 10021304383. The reversal of 10021304341 is 14340312001.
10021304341 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8750667025 + 1270637316 = 93545^2 + 35646^2 .
It is an emirp because it is prime and its reverse (14340312001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10021304341 - 21 = 10021304339 is a prime.
Together with 10021304339, 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 (10021307341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010652170 + 5010652171.
It is an arithmetic number, because the mean of its divisors is an integer number (5010652171).
Almost surely, 210021304341 is an apocalyptic number.
It is an amenable number.
10021304341 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021304341 is an equidigital number, since it uses as much as digits as its factorization.
10021304341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10021304341 its reverse (14340312001), we get a palindrome (24361616342).
The spelling of 10021304341 in words is "ten billion, twenty-one million, three hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •