Base | Representation |
---|---|
bin | 11000100011010101011010… |
… | …111001101111010001011101 |
3 | 112011022220121022100111100011 |
4 | 120203111122321233101131 |
5 | 103123131144223432023 |
6 | 1021353531243203221 |
7 | 31513251136542034 |
oct | 3043253271572135 |
9 | 464286538314304 |
10 | 107981297874013 |
11 | 3145167a646343 |
12 | 1013b5ba216511 |
13 | 4833792204865 |
14 | 1c944736d571b |
15 | c73c948d950d |
hex | 62355ae6f45d |
107981297874013 has 2 divisors, whose sum is σ = 107981297874014. Its totient is φ = 107981297874012.
The previous prime is 107981297873993. The next prime is 107981297874077. The reversal of 107981297874013 is 310478792189701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64463765118489 + 43517532755524 = 8028933^2 + 6596782^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107981297874013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 107981297874013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107981297574013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53990648937006 + 53990648937007.
It is an arithmetic number, because the mean of its divisors is an integer number (53990648937007).
Almost surely, 2107981297874013 is an apocalyptic number.
It is an amenable number.
107981297874013 is a deficient number, since it is larger than the sum of its proper divisors (1).
107981297874013 is an equidigital number, since it uses as much as digits as its factorization.
107981297874013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42674688, while the sum is 67.
The spelling of 107981297874013 in words is "one hundred seven trillion, nine hundred eighty-one billion, two hundred ninety-seven million, eight hundred seventy-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •