Base | Representation |
---|---|
bin | 10011010011011011… |
… | …01101100000010101 |
3 | 222202020210121212111 |
4 | 21221231231200111 |
5 | 132211030301031 |
6 | 4432210151021 |
7 | 514550340004 |
oct | 115155554025 |
9 | 28666717774 |
10 | 10363525141 |
11 | 4438a37912 |
12 | 2012882471 |
13 | c920ca8c8 |
14 | 704550c3b |
15 | 409c691b1 |
hex | 269b6d815 |
10363525141 has 2 divisors, whose sum is σ = 10363525142. Its totient is φ = 10363525140.
The previous prime is 10363525099. The next prime is 10363525181. The reversal of 10363525141 is 14152536301.
10363525141 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., 10070122500 + 293402641 = 100350^2 + 17129^2 .
It is a cyclic number.
It is not a de Polignac number, because 10363525141 - 27 = 10363525013 is a prime.
It is a super-3 number, since 3×103635251413 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10363525181) 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, 5181762570 + 5181762571.
It is an arithmetic number, because the mean of its divisors is an integer number (5181762571).
Almost surely, 210363525141 is an apocalyptic number.
It is an amenable number.
10363525141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10363525141 is an equidigital number, since it uses as much as digits as its factorization.
10363525141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 10363525141 in words is "ten billion, three hundred sixty-three million, five hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •