Base | Representation |
---|---|
bin | 1001001110001111010010… |
… | …0110110100101000111101 |
3 | 1022220101200211101110012102 |
4 | 2103203310212310220331 |
5 | 2312114141004330344 |
6 | 33322204504314445 |
7 | 2064415161160055 |
oct | 223436446645075 |
9 | 38811624343172 |
10 | 10140226636349 |
11 | 325a49a643427 |
12 | 11792b1472a25 |
13 | 5872b096c764 |
14 | 270b0a8b4565 |
15 | 128b859d0e4e |
hex | 938f49b4a3d |
10140226636349 has 2 divisors, whose sum is σ = 10140226636350. Its totient is φ = 10140226636348.
The previous prime is 10140226636289. The next prime is 10140226636373. The reversal of 10140226636349 is 94363662204101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9308814571225 + 831412065124 = 3051035^2 + 911818^2 .
It is an emirp because it is prime and its reverse (94363662204101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10140226636349 - 216 = 10140226570813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140226636049) 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, 5070113318174 + 5070113318175.
It is an arithmetic number, because the mean of its divisors is an integer number (5070113318175).
Almost surely, 210140226636349 is an apocalyptic number.
It is an amenable number.
10140226636349 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140226636349 is an equidigital number, since it uses as much as digits as its factorization.
10140226636349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 47.
The spelling of 10140226636349 in words is "ten trillion, one hundred forty billion, two hundred twenty-six million, six hundred thirty-six thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •