Base | Representation |
---|---|
bin | 1001010101000000100100… |
… | …0010111001001000101110 |
3 | 1100022111220110120020011222 |
4 | 2111100021002321020232 |
5 | 2321020340103443420 |
6 | 33451441515343342 |
7 | 2106003315423200 |
oct | 225201102711056 |
9 | 40274813506158 |
10 | 10256533656110 |
11 | 32a4853952865 |
12 | 1197950451b52 |
13 | 595257a20401 |
14 | 2765c1586770 |
15 | 12bbe165a225 |
hex | 954090b922e |
10256533656110 has 48 divisors (see below), whose sum is σ = 21676635269424. Its totient is φ = 3483661079808.
The previous prime is 10256533656107. The next prime is 10256533656163. The reversal of 10256533656110 is 1165633565201.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 97759259 + ... + 97864118.
It is an arithmetic number, because the mean of its divisors is an integer number (451596568113).
Almost surely, 210256533656110 is an apocalyptic number.
10256533656110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10256533656110 is an abundant number, since it is smaller than the sum of its proper divisors (11420101613314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10256533656110 is a wasteful number, since it uses less digits than its factorization.
10256533656110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195623505 (or 195623498 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 44.
Subtracting from 10256533656110 its reverse (1165633565201), we obtain a palindrome (9090900090909).
The spelling of 10256533656110 in words is "ten trillion, two hundred fifty-six billion, five hundred thirty-three million, six hundred fifty-six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •