Base | Representation |
---|---|
bin | 10010111001010011… |
… | …00000100111101101 |
3 | 222011222022211220212 |
4 | 21130221200213231 |
5 | 131233421214411 |
6 | 4354335552205 |
7 | 506246203625 |
oct | 113451404755 |
9 | 28158284825 |
10 | 10144319981 |
11 | 4336227824 |
12 | 1b7138b665 |
13 | c5887ac03 |
14 | 6c33ad885 |
15 | 3e58b968b |
hex | 25ca609ed |
10144319981 has 2 divisors, whose sum is σ = 10144319982. Its totient is φ = 10144319980.
The previous prime is 10144319957. The next prime is 10144320013. The reversal of 10144319981 is 18991344101.
10144319981 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., 10030022500 + 114297481 = 100150^2 + 10691^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10144319981 is a prime.
It is a super-2 number, since 2×101443199812 (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 (10144316981) 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, 5072159990 + 5072159991.
It is an arithmetic number, because the mean of its divisors is an integer number (5072159991).
Almost surely, 210144319981 is an apocalyptic number.
It is an amenable number.
10144319981 is a deficient number, since it is larger than the sum of its proper divisors (1).
10144319981 is an equidigital number, since it uses as much as digits as its factorization.
10144319981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 41.
The spelling of 10144319981 in words is "ten billion, one hundred forty-four million, three hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •