Base | Representation |
---|---|
bin | 10011101101011001… |
… | …11001010011011101 |
3 | 1000022102210120202012 |
4 | 21312230321103131 |
5 | 133132320241013 |
6 | 4505552241005 |
7 | 523134354542 |
oct | 116654712335 |
9 | 30272716665 |
10 | 10581415133 |
11 | 453aa29893 |
12 | 2073840165 |
13 | cc82a9ab3 |
14 | 72546cbc9 |
15 | 41de591a8 |
hex | 276b394dd |
10581415133 has 2 divisors, whose sum is σ = 10581415134. Its totient is φ = 10581415132.
The previous prime is 10581415093. The next prime is 10581415151. The reversal of 10581415133 is 33151418501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5577550489 + 5003864644 = 74683^2 + 70738^2 .
It is an emirp because it is prime and its reverse (33151418501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10581415133 - 212 = 10581411037 is a prime.
It is a super-2 number, since 2×105814151332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10581415133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10581414133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5290707566 + 5290707567.
It is an arithmetic number, because the mean of its divisors is an integer number (5290707567).
Almost surely, 210581415133 is an apocalyptic number.
It is an amenable number.
10581415133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10581415133 is an equidigital number, since it uses as much as digits as its factorization.
10581415133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 10581415133 in words is "ten billion, five hundred eighty-one million, four hundred fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •