Base | Representation |
---|---|
bin | 1100011000100111000101… |
… | …1001110000111111000011 |
3 | 1210012202201120201022120222 |
4 | 3012021301121300333003 |
5 | 3241100002410023341 |
6 | 44543312344453255 |
7 | 2603535454654313 |
oct | 306116131607703 |
9 | 53182646638528 |
10 | 13616948907971 |
11 | 437aa08735752 |
12 | 163b08077a22b |
13 | 77a0c3b5a846 |
14 | 3510c7289443 |
15 | 18931c48844b |
hex | c6271670fc3 |
13616948907971 has 2 divisors, whose sum is σ = 13616948907972. Its totient is φ = 13616948907970.
The previous prime is 13616948907959. The next prime is 13616948907983. The reversal of 13616948907971 is 17970984961631.
13616948907971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (13616948907959) and next prime (13616948907983).
It is a cyclic number.
It is not a de Polignac number, because 13616948907971 - 218 = 13616948645827 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13616948907895 and 13616948907904.
It is not a weakly prime, because it can be changed into another prime (13616948907371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6808474453985 + 6808474453986.
It is an arithmetic number, because the mean of its divisors is an integer number (6808474453986).
Almost surely, 213616948907971 is an apocalyptic number.
13616948907971 is a deficient number, since it is larger than the sum of its proper divisors (1).
13616948907971 is an equidigital number, since it uses as much as digits as its factorization.
13616948907971 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 123451776, while the sum is 71.
The spelling of 13616948907971 in words is "thirteen trillion, six hundred sixteen billion, nine hundred forty-eight million, nine hundred seven thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •