Base | Representation |
---|---|
bin | 10011100100010011… |
… | …10100001111100101 |
3 | 1000010010012220110201 |
4 | 21302021310033211 |
5 | 133003302014001 |
6 | 4454224550501 |
7 | 521216652214 |
oct | 116211641745 |
9 | 30103186421 |
10 | 10505110501 |
11 | 4500952006 |
12 | 2052182431 |
13 | cb5541722 |
14 | 71928907b |
15 | 4173d5501 |
hex | 2722743e5 |
10505110501 has 2 divisors, whose sum is σ = 10505110502. Its totient is φ = 10505110500.
The previous prime is 10505110493. The next prime is 10505110519. The reversal of 10505110501 is 10501150501.
It is a happy number.
10505110501 is digitally balanced in base 2, 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., 10491085476 + 14025025 = 102426^2 + 3745^2 .
It is a cyclic number.
It is not a de Polignac number, because 10505110501 - 23 = 10505110493 is a prime.
It is a super-2 number, since 2×105051105012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10505110541) 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 as a sum of consecutive naturals, namely, 5252555250 + 5252555251.
It is an arithmetic number, because the mean of its divisors is an integer number (5252555251).
Almost surely, 210505110501 is an apocalyptic number.
It is an amenable number.
10505110501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10505110501 is an equidigital number, since it uses as much as digits as its factorization.
10505110501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125, while the sum is 19.
The spelling of 10505110501 in words is "ten billion, five hundred five million, one hundred ten thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •