Base | Representation |
---|---|
bin | 10011001111011100… |
… | …10100101110001101 |
3 | 222122220222001012002 |
4 | 21213232110232031 |
5 | 132124003200331 |
6 | 4425014322045 |
7 | 513663444665 |
oct | 114756245615 |
9 | 28586861162 |
10 | 10330131341 |
11 | 44210a9632 |
12 | 2003659325 |
13 | c88207c6a |
14 | 6ddd3b1a5 |
15 | 406d6e9cb |
hex | 267b94b8d |
10330131341 has 2 divisors, whose sum is σ = 10330131342. Its totient is φ = 10330131340.
The previous prime is 10330131313. The next prime is 10330131347. The reversal of 10330131341 is 14313103301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9238093225 + 1092038116 = 96115^2 + 33046^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10330131341 is a prime.
It is a super-2 number, since 2×103301313412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10330131347) 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, 5165065670 + 5165065671.
It is an arithmetic number, because the mean of its divisors is an integer number (5165065671).
Almost surely, 210330131341 is an apocalyptic number.
It is an amenable number.
10330131341 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330131341 is an equidigital number, since it uses as much as digits as its factorization.
10330131341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10330131341 its reverse (14313103301), we get a palindrome (24643234642).
The spelling of 10330131341 in words is "ten billion, three hundred thirty million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •