Base | Representation |
---|---|
bin | 1001010101000000101001… |
… | …1000111001011010001101 |
3 | 1100022111222000222122210121 |
4 | 2111100022120321122031 |
5 | 2321020411341422423 |
6 | 33451444042504541 |
7 | 2106004011153421 |
oct | 225201230713215 |
9 | 40274860878717 |
10 | 10256556201613 |
11 | 32a4865651607 |
12 | 1197957b05151 |
13 | 59525c5b5347 |
14 | 2765c4574b81 |
15 | 12bbe361045d |
hex | 9540a63968d |
10256556201613 has 16 divisors (see below), whose sum is σ = 10874356764480. Its totient is φ = 9640366799616.
The previous prime is 10256556201599. The next prime is 10256556201631. The reversal of 10256556201613 is 31610265565201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10256556201613 - 25 = 10256556201581 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10256556201613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10256556201653) 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 15 ways as a sum of consecutive naturals, for example, 123229870 + ... + 123313072.
It is an arithmetic number, because the mean of its divisors is an integer number (679647297780).
Almost surely, 210256556201613 is an apocalyptic number.
It is an amenable number.
10256556201613 is a deficient number, since it is larger than the sum of its proper divisors (617800562867).
10256556201613 is an equidigital number, since it uses as much as digits as its factorization.
10256556201613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92796.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 10256556201613 in words is "ten trillion, two hundred fifty-six billion, five hundred fifty-six million, two hundred one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •