Base | Representation |
---|---|
bin | 1001010100000111100011… |
… | …1000100111001111101101 |
3 | 1100021001101221022002012201 |
4 | 2111001320320213033231 |
5 | 2320243014403443042 |
6 | 33440431200101501 |
7 | 2104622141612254 |
oct | 225017070471755 |
9 | 40231357262181 |
10 | 10241230140397 |
11 | 3299310475a13 |
12 | 119499b304891 |
13 | 593989345279 |
14 | 27596cd1579b |
15 | 12b5e7d901b7 |
hex | 95078e273ed |
10241230140397 has 2 divisors, whose sum is σ = 10241230140398. Its totient is φ = 10241230140396.
The previous prime is 10241230140391. The next prime is 10241230140439. The reversal of 10241230140397 is 79304103214201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8030994877801 + 2210235262596 = 2833901^2 + 1486686^2 .
It is a cyclic number.
It is not a de Polignac number, because 10241230140397 - 227 = 10241095922669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10241230140391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120615070198 + 5120615070199.
It is an arithmetic number, because the mean of its divisors is an integer number (5120615070199).
Almost surely, 210241230140397 is an apocalyptic number.
It is an amenable number.
10241230140397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241230140397 is an equidigital number, since it uses as much as digits as its factorization.
10241230140397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 37.
Adding to 10241230140397 its reverse (79304103214201), we get a palindrome (89545333354598).
The spelling of 10241230140397 in words is "ten trillion, two hundred forty-one billion, two hundred thirty million, one hundred forty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •