Base | Representation |
---|---|
bin | 10011011000111101… |
… | …00111010010000101 |
3 | 222212111001200001001 |
4 | 21230132213102011 |
5 | 132304413233031 |
6 | 4440544133301 |
7 | 515652453115 |
oct | 115436472205 |
9 | 28774050031 |
10 | 10409899141 |
11 | 4462131334 |
12 | 2026307231 |
13 | c9b8b6745 |
14 | 70a783045 |
15 | 40dd79861 |
hex | 26c7a7485 |
10409899141 has 2 divisors, whose sum is σ = 10409899142. Its totient is φ = 10409899140.
The previous prime is 10409899133. The next prime is 10409899147. The reversal of 10409899141 is 14199890401.
10409899141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7714108900 + 2695790241 = 87830^2 + 51921^2 .
It is a cyclic number.
It is not a de Polignac number, because 10409899141 - 23 = 10409899133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10409899091 and 10409899100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10409899147) 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, 5204949570 + 5204949571.
It is an arithmetic number, because the mean of its divisors is an integer number (5204949571).
Almost surely, 210409899141 is an apocalyptic number.
It is an amenable number.
10409899141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10409899141 is an equidigital number, since it uses as much as digits as its factorization.
10409899141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 46.
The spelling of 10409899141 in words is "ten billion, four hundred nine million, eight hundred ninety-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •