Base | Representation |
---|---|
bin | 110000100001110010… |
… | …1100110000110111101 |
3 | 100221222210102020021222 |
4 | 1201003211212012331 |
5 | 3201412031101442 |
6 | 115512545203125 |
7 | 10346333052104 |
oct | 1410345460675 |
9 | 327883366258 |
10 | 104213143997 |
11 | 4021866a596 |
12 | 182449304a5 |
13 | 9a9a63b061 |
14 | 508881903b |
15 | 2a9e0638d2 |
hex | 18439661bd |
104213143997 has 4 divisors (see below), whose sum is σ = 110343328956. Its totient is φ = 98082959040.
The previous prime is 104213143987. The next prime is 104213144047. The reversal of 104213143997 is 799341312401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 94758693241 + 9454450756 = 307829^2 + 97234^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104213143997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104213143927) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3065092454 + ... + 3065092487.
It is an arithmetic number, because the mean of its divisors is an integer number (27585832239).
Almost surely, 2104213143997 is an apocalyptic number.
104213143997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
104213143997 is a deficient number, since it is larger than the sum of its proper divisors (6130184959).
104213143997 is an equidigital number, since it uses as much as digits as its factorization.
104213143997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6130184958.
The product of its (nonzero) digits is 163296, while the sum is 44.
The spelling of 104213143997 in words is "one hundred four billion, two hundred thirteen million, one hundred forty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •