Base | Representation |
---|---|
bin | 1100010101010111101110… |
… | …0111010011000101000101 |
3 | 1210000110001022110222100210 |
4 | 3011111323213103011011 |
5 | 3234142003111342210 |
6 | 44501545120030033 |
7 | 2566525205052462 |
oct | 305257347230505 |
9 | 53013038428323 |
10 | 13561285652805 |
11 | 4359344233230 |
12 | 1630327162319 |
13 | 774a92a16b77 |
14 | 34c526766669 |
15 | 187b60826e20 |
hex | c557b9d3145 |
13561285652805 has 16 divisors (see below), whose sum is σ = 23670607685184. Its totient is φ = 6575168801280.
The previous prime is 13561285652777. The next prime is 13561285652807. The reversal of 13561285652805 is 50825658216531.
It is a happy number.
It is not a de Polignac number, because 13561285652805 - 224 = 13561268875589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13561285652807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41094804844 + ... + 41094805173.
It is an arithmetic number, because the mean of its divisors is an integer number (1479412980324).
Almost surely, 213561285652805 is an apocalyptic number.
13561285652805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13561285652805 is a deficient number, since it is larger than the sum of its proper divisors (10109322032379).
13561285652805 is a wasteful number, since it uses less digits than its factorization.
13561285652805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82189610036.
The product of its (nonzero) digits is 17280000, while the sum is 57.
The spelling of 13561285652805 in words is "thirteen trillion, five hundred sixty-one billion, two hundred eighty-five million, six hundred fifty-two thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •