Base | Representation |
---|---|
bin | 1100000100001111100110… |
… | …0010110111100100111011 |
3 | 1201222022120020001111212212 |
4 | 3001003321202313210323 |
5 | 3214331402143133441 |
6 | 44114444024125335 |
7 | 2536340521404503 |
oct | 301037142674473 |
9 | 51868506044785 |
10 | 13267045677371 |
11 | 4255582460712 |
12 | 15a32aa90684b |
13 | 753100341425 |
14 | 33c1b2606a03 |
15 | 18018db9beeb |
hex | c10f98b793b |
13267045677371 has 8 divisors (see below), whose sum is σ = 13275936689088. Its totient is φ = 13258156680000.
The previous prime is 13267045677359. The next prime is 13267045677377. The reversal of 13267045677371 is 17377654076231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13267045677371 - 214 = 13267045660987 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 13267045677371.
It is not an unprimeable number, because it can be changed into a prime (13267045677377) 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 7 ways as a sum of consecutive naturals, for example, 12790751 + ... + 13789031.
It is an arithmetic number, because the mean of its divisors is an integer number (1659492086136).
Almost surely, 213267045677371 is an apocalyptic number.
13267045677371 is a deficient number, since it is larger than the sum of its proper divisors (8891011717).
13267045677371 is an equidigital number, since it uses as much as digits as its factorization.
13267045677371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007173.
The product of its (nonzero) digits is 31116960, while the sum is 59.
The spelling of 13267045677371 in words is "thirteen trillion, two hundred sixty-seven billion, forty-five million, six hundred seventy-seven thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •