Base | Representation |
---|---|
bin | 1011111100000110110110… |
… | …1100111101101101011111 |
3 | 1201110221202100200210222211 |
4 | 2333001231230331231133 |
5 | 3210034112200411343 |
6 | 43530325200021251 |
7 | 2523261516460015 |
oct | 277015554755537 |
9 | 51427670623884 |
10 | 13127260560223 |
11 | 42012703a5207 |
12 | 1580199001827 |
13 | 742b84147964 |
14 | 3355117528b5 |
15 | 17b70bc7479d |
hex | bf06db3db5f |
13127260560223 has 2 divisors, whose sum is σ = 13127260560224. Its totient is φ = 13127260560222.
The previous prime is 13127260560209. The next prime is 13127260560257. The reversal of 13127260560223 is 32206506272131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13127260560223 - 29 = 13127260559711 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13127260560823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6563630280111 + 6563630280112.
It is an arithmetic number, because the mean of its divisors is an integer number (6563630280112).
Almost surely, 213127260560223 is an apocalyptic number.
13127260560223 is a deficient number, since it is larger than the sum of its proper divisors (1).
13127260560223 is an equidigital number, since it uses as much as digits as its factorization.
13127260560223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 40.
The spelling of 13127260560223 in words is "thirteen trillion, one hundred twenty-seven billion, two hundred sixty million, five hundred sixty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •