Base | Representation |
---|---|
bin | 10011010000110011… |
… | …01100010010010101 |
3 | 222200201100122010111 |
4 | 21220121230102111 |
5 | 132134411000203 |
6 | 4430102123021 |
7 | 514162204633 |
oct | 115031542225 |
9 | 28621318114 |
10 | 10341500053 |
11 | 4427564065 |
12 | 2007420471 |
13 | c8a688801 |
14 | 70165a353 |
15 | 407d6826d |
hex | 26866c495 |
10341500053 has 2 divisors, whose sum is σ = 10341500054. Its totient is φ = 10341500052.
The previous prime is 10341500041. The next prime is 10341500083. The reversal of 10341500053 is 35000514301.
It is a happy number.
10341500053 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., 9291610449 + 1049889604 = 96393^2 + 32402^2 .
It is an emirp because it is prime and its reverse (35000514301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10341500053 - 229 = 9804629141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10341499997 and 10341500033.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10341500083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170750026 + 5170750027.
It is an arithmetic number, because the mean of its divisors is an integer number (5170750027).
Almost surely, 210341500053 is an apocalyptic number.
It is an amenable number.
10341500053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341500053 is an equidigital number, since it uses as much as digits as its factorization.
10341500053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 22.
The spelling of 10341500053 in words is "ten billion, three hundred forty-one million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •