Base | Representation |
---|---|
bin | 1001000110000101011100… |
… | …0101011000010011100101 |
3 | 1022102000010021212120212121 |
4 | 2101201113011120103211 |
5 | 2302320244043040112 |
6 | 33134000402345541 |
7 | 2051325625044316 |
oct | 221412705302345 |
9 | 38360107776777 |
10 | 10000144893157 |
11 | 32060460a8431 |
12 | 115611835b2b1 |
13 | 577018189b13 |
14 | 26801c48860d |
15 | 1251d7a14407 |
hex | 918571584e5 |
10000144893157 has 2 divisors, whose sum is σ = 10000144893158. Its totient is φ = 10000144893156.
The previous prime is 10000144893143. The next prime is 10000144893163. The reversal of 10000144893157 is 75139844100001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9998028985156 + 2115908001 = 3161966^2 + 45999^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000144893157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000144897157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000072446578 + 5000072446579.
It is an arithmetic number, because the mean of its divisors is an integer number (5000072446579).
Almost surely, 210000144893157 is an apocalyptic number.
It is an amenable number.
10000144893157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000144893157 is an equidigital number, since it uses as much as digits as its factorization.
10000144893157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 43.
Adding to 10000144893157 its reverse (75139844100001), we get a palindrome (85139988993158).
The spelling of 10000144893157 in words is "ten trillion, one hundred forty-four million, eight hundred ninety-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •