Base | Representation |
---|---|
bin | 10010111001010001… |
… | …10100111101100001 |
3 | 222011221222202121121 |
4 | 21130220310331201 |
5 | 131233400004103 |
6 | 4354332052241 |
7 | 506244530356 |
oct | 113450647541 |
9 | 28157882547 |
10 | 10144141153 |
11 | 4336115433 |
12 | 1b71304081 |
13 | c588176b3 |
14 | 6c336462d |
15 | 3e58816bd |
hex | 25ca34f61 |
10144141153 has 2 divisors, whose sum is σ = 10144141154. Its totient is φ = 10144141152.
The previous prime is 10144141103. The next prime is 10144141207. The reversal of 10144141153 is 35114144101.
10144141153 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., 7578921249 + 2565219904 = 87057^2 + 50648^2 .
It is a cyclic number.
It is not a de Polignac number, because 10144141153 - 213 = 10144132961 is a prime.
It is not a weakly prime, because it can be changed into another prime (10144141103) 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, 5072070576 + 5072070577.
It is an arithmetic number, because the mean of its divisors is an integer number (5072070577).
Almost surely, 210144141153 is an apocalyptic number.
It is an amenable number.
10144141153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10144141153 is an equidigital number, since it uses as much as digits as its factorization.
10144141153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 10144141153 its reverse (35114144101), we get a palindrome (45258285254).
The spelling of 10144141153 in words is "ten billion, one hundred forty-four million, one hundred forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •