Base | Representation |
---|---|
bin | 1001010101000000000111… |
… | …0000101000110011011111 |
3 | 1100022111120221120111122010 |
4 | 2111100001300220303133 |
5 | 2321020112311230421 |
6 | 33451421431522303 |
7 | 2106000302501160 |
oct | 225200160506337 |
9 | 40274527514563 |
10 | 10256411430111 |
11 | 32a47a0960640 |
12 | 1197917529393 |
13 | 5952385c7232 |
14 | 2765ad24b767 |
15 | 12bbd5a65076 |
hex | 95401c28cdf |
10256411430111 has 64 divisors (see below), whose sum is σ = 17687505669120. Its totient is φ = 5129707376640.
The previous prime is 10256411430037. The next prime is 10256411430137. The reversal of 10256411430111 is 11103411465201.
It is not a de Polignac number, because 10256411430111 - 219 = 10256410905823 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10256411430011) 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 in 63 ways as a sum of consecutive naturals, for example, 196141 + ... + 4533353.
It is an arithmetic number, because the mean of its divisors is an integer number (276367276080).
Almost surely, 210256411430111 is an apocalyptic number.
10256411430111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10256411430111 is a deficient number, since it is larger than the sum of its proper divisors (7431094239009).
10256411430111 is a wasteful number, since it uses less digits than its factorization.
10256411430111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4337616.
The product of its (nonzero) digits is 2880, while the sum is 30.
Adding to 10256411430111 its reverse (11103411465201), we get a palindrome (21359822895312).
The spelling of 10256411430111 in words is "ten trillion, two hundred fifty-six billion, four hundred eleven million, four hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •