Base | Representation |
---|---|
bin | 10011011001001000… |
… | …00100111010111101 |
3 | 222212120202102112112 |
4 | 21230210010322331 |
5 | 132310300100021 |
6 | 4441034543405 |
7 | 516000566312 |
oct | 115444047275 |
9 | 28776672475 |
10 | 10411331261 |
11 | 4462a1a301 |
12 | 2026897b65 |
13 | c9bc98556 |
14 | 70aa36d09 |
15 | 40e05dd5b |
hex | 26c904ebd |
10411331261 has 2 divisors, whose sum is σ = 10411331262. Its totient is φ = 10411331260.
The previous prime is 10411331239. The next prime is 10411331291. The reversal of 10411331261 is 16213311401.
It is a happy number.
10411331261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10367108761 + 44222500 = 101819^2 + 6650^2 .
It is a cyclic number.
It is not a de Polignac number, because 10411331261 - 226 = 10344222397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10411331291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5205665630 + 5205665631.
It is an arithmetic number, because the mean of its divisors is an integer number (5205665631).
Almost surely, 210411331261 is an apocalyptic number.
It is an amenable number.
10411331261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10411331261 is an equidigital number, since it uses as much as digits as its factorization.
10411331261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 10411331261 its reverse (16213311401), we get a palindrome (26624642662).
The spelling of 10411331261 in words is "ten billion, four hundred eleven million, three hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •