Base | Representation |
---|---|
bin | 1100000000010111111010… |
… | …1101010101011100001011 |
3 | 1201201221221202010010020211 |
4 | 3000011332231111130023 |
5 | 3212234221420022443 |
6 | 44024130444101551 |
7 | 2531465122215310 |
oct | 300057655253413 |
9 | 51657852103224 |
10 | 13200560314123 |
11 | 422a365183216 |
12 | 1592434b348b7 |
13 | 749a660b95c0 |
14 | 338ca66bcd07 |
15 | 17d59bdda19d |
hex | c017eb5570b |
13200560314123 has 16 divisors (see below), whose sum is σ = 16256111682496. Its totient is φ = 10438441228800.
The previous prime is 13200560314111. The next prime is 13200560314127. The reversal of 13200560314123 is 32141306500231.
13200560314123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13200560314123 - 237 = 13063121360651 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13200560314127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41215578 + ... + 41534623.
It is an arithmetic number, because the mean of its divisors is an integer number (1016006980156).
Almost surely, 213200560314123 is an apocalyptic number.
13200560314123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13200560314123 is a deficient number, since it is larger than the sum of its proper divisors (3055551368373).
13200560314123 is a wasteful number, since it uses less digits than its factorization.
13200560314123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82751974.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 13200560314123 its reverse (32141306500231), we get a palindrome (45341866814354).
The spelling of 13200560314123 in words is "thirteen trillion, two hundred billion, five hundred sixty million, three hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •