Base | Representation |
---|---|
bin | 10010111001010100… |
… | …11100011110010101 |
3 | 222011222210022012212 |
4 | 21130222130132111 |
5 | 131234002041031 |
6 | 4354345123205 |
7 | 506251244444 |
oct | 113452343625 |
9 | 28158708185 |
10 | 10144565141 |
11 | 4336384a37 |
12 | 1b71489505 |
13 | c58935689 |
14 | 6c3434d5b |
15 | 3e591712b |
hex | 25ca9c795 |
10144565141 has 2 divisors, whose sum is σ = 10144565142. Its totient is φ = 10144565140.
The previous prime is 10144565083. The next prime is 10144565161. The reversal of 10144565141 is 14156544101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9949264516 + 195300625 = 99746^2 + 13975^2 .
It is a cyclic number.
It is not a de Polignac number, because 10144565141 - 210 = 10144564117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10144565098 and 10144565107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10144565161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5072282570 + 5072282571.
It is an arithmetic number, because the mean of its divisors is an integer number (5072282571).
Almost surely, 210144565141 is an apocalyptic number.
It is an amenable number.
10144565141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10144565141 is an equidigital number, since it uses as much as digits as its factorization.
10144565141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9600, while the sum is 32.
The spelling of 10144565141 in words is "ten billion, one hundred forty-four million, five hundred sixty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •