Base | Representation |
---|---|
bin | 10010111000001101… |
… | …00010010111100111 |
3 | 222011100002001221211 |
4 | 21130012202113213 |
5 | 131224044331403 |
6 | 4353411252251 |
7 | 506105241256 |
oct | 113406422747 |
9 | 28140061854 |
10 | 10135152103 |
11 | 433103586a |
12 | 1b6a2aa087 |
13 | c569bb02b |
14 | 6c20a479d |
15 | 3e4ba806d |
hex | 25c1a25e7 |
10135152103 has 4 divisors (see below), whose sum is σ = 10135722168. Its totient is φ = 10134582040.
The previous prime is 10135152077. The next prime is 10135152133. The reversal of 10135152103 is 30125153101.
10135152103 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30125153101 = 71 ⋅424297931.
It is a cyclic number.
It is not a de Polignac number, because 10135152103 - 217 = 10135021031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10135152133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 257476 + ... + 294217.
It is an arithmetic number, because the mean of its divisors is an integer number (2533930542).
Almost surely, 210135152103 is an apocalyptic number.
10135152103 is a deficient number, since it is larger than the sum of its proper divisors (570065).
10135152103 is an equidigital number, since it uses as much as digits as its factorization.
10135152103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570064.
The product of its (nonzero) digits is 450, while the sum is 22.
The spelling of 10135152103 in words is "ten billion, one hundred thirty-five million, one hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •