Base | Representation |
---|---|
bin | 10011100011111101… |
… | …11000101100011111 |
3 | 1000002220211022221122 |
4 | 21301332320230133 |
5 | 133002033321101 |
6 | 4454043321155 |
7 | 521153416346 |
oct | 116176705437 |
9 | 30086738848 |
10 | 10502245151 |
11 | 44aa275252 |
12 | 20512201bb |
13 | cb4a7a458 |
14 | 718b40b5d |
15 | 41701b51b |
hex | 271fb8b1f |
10502245151 has 2 divisors, whose sum is σ = 10502245152. Its totient is φ = 10502245150.
The previous prime is 10502245121. The next prime is 10502245153. The reversal of 10502245151 is 15154220501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10502245151 is a prime.
It is a super-2 number, since 2×105022451512 (a number of 21 digits) contains 22 as substring.
Together with 10502245153, 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 10502245151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10502245153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5251122575 + 5251122576.
It is an arithmetic number, because the mean of its divisors is an integer number (5251122576).
Almost surely, 210502245151 is an apocalyptic number.
10502245151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10502245151 is an equidigital number, since it uses as much as digits as its factorization.
10502245151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 10502245151 its reverse (15154220501), we get a palindrome (25656465652).
The spelling of 10502245151 in words is "ten billion, five hundred two million, two hundred forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •