Base | Representation |
---|---|
bin | 1100110011011110000010… |
… | …1010011101101111110111 |
3 | 1211211212202022011222212112 |
4 | 3030313200222131233313 |
5 | 3321130004011313041 |
6 | 45535303411241235 |
7 | 2652062210345522 |
oct | 314674052355767 |
9 | 54755668158775 |
10 | 14078377057271 |
11 | 453867390a88a |
12 | 16b4597ba921b |
13 | 7b177ba7c307 |
14 | 36957b85dbb9 |
15 | 196326b89deb |
hex | ccde0a9dbf7 |
14078377057271 has 2 divisors, whose sum is σ = 14078377057272. Its totient is φ = 14078377057270.
The previous prime is 14078377057237. The next prime is 14078377057321. The reversal of 14078377057271 is 17275077387041.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (17275077387041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14078377057271 - 242 = 9680330546167 is a prime.
It is a super-2 number, since 2×140783770572712 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14078377057271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14078337057271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7039188528635 + 7039188528636.
It is an arithmetic number, because the mean of its divisors is an integer number (7039188528636).
Almost surely, 214078377057271 is an apocalyptic number.
14078377057271 is a deficient number, since it is larger than the sum of its proper divisors (1).
14078377057271 is an equidigital number, since it uses as much as digits as its factorization.
14078377057271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16134720, while the sum is 59.
The spelling of 14078377057271 in words is "fourteen trillion, seventy-eight billion, three hundred seventy-seven million, fifty-seven thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •