Base | Representation |
---|---|
bin | 10010111001010100… |
… | …00001111011001101 |
3 | 222011222120210001022 |
4 | 21130222001323031 |
5 | 131233440101042 |
6 | 4354342523525 |
7 | 506250312425 |
oct | 113452017315 |
9 | 28158523038 |
10 | 10144456397 |
11 | 4336310269 |
12 | 1b714365a5 |
13 | c588c802a |
14 | 6c3407485 |
15 | 3e58e4cd2 |
hex | 25ca81ecd |
10144456397 has 2 divisors, whose sum is σ = 10144456398. Its totient is φ = 10144456396.
The previous prime is 10144456373. The next prime is 10144456403. The reversal of 10144456397 is 79365444101.
10144456397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9828541321 + 315915076 = 99139^2 + 17774^2 .
It is an emirp because it is prime and its reverse (79365444101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10144456397 - 212 = 10144452301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10144456297) 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, 5072228198 + 5072228199.
It is an arithmetic number, because the mean of its divisors is an integer number (5072228199).
Almost surely, 210144456397 is an apocalyptic number.
It is an amenable number.
10144456397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10144456397 is an equidigital number, since it uses as much as digits as its factorization.
10144456397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 10144456397 in words is "ten billion, one hundred forty-four million, four hundred fifty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •