Base | Representation |
---|---|
bin | 1001100011010011000011… |
… | …0010010110111101011011 |
3 | 1101011222112101021201100221 |
4 | 2120310300302112331123 |
5 | 2334031110431440311 |
6 | 34200320341340511 |
7 | 2132513454155266 |
oct | 230646062267533 |
9 | 41158471251327 |
10 | 10502013546331 |
11 | 338997395069a |
12 | 121743b107737 |
13 | 5b24494b4418 |
14 | 28442b935cdd |
15 | 1332ac712671 |
hex | 98d30c96f5b |
10502013546331 has 2 divisors, whose sum is σ = 10502013546332. Its totient is φ = 10502013546330.
The previous prime is 10502013546319. The next prime is 10502013546407. The reversal of 10502013546331 is 13364531020501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10502013546331 - 27 = 10502013546203 is a prime.
It is a super-2 number, since 2×105020135463312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10502013546131) 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, 5251006773165 + 5251006773166.
It is an arithmetic number, because the mean of its divisors is an integer number (5251006773166).
Almost surely, 210502013546331 is an apocalyptic number.
10502013546331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10502013546331 is an equidigital number, since it uses as much as digits as its factorization.
10502013546331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 10502013546331 its reverse (13364531020501), we get a palindrome (23866544566832).
The spelling of 10502013546331 in words is "ten trillion, five hundred two billion, thirteen million, five hundred forty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •