Base | Representation |
---|---|
bin | 110000100001110011… |
… | …0010100101111100101 |
3 | 100221222210202221022122 |
4 | 1201003212110233211 |
5 | 3201412103210023 |
6 | 115512553235325 |
7 | 10346334506024 |
oct | 1410346245745 |
9 | 327883687278 |
10 | 104213335013 |
11 | 40218790057 |
12 | 18244a02b45 |
13 | 9a9a6a6c98 |
14 | 50888688bb |
15 | 2a9e0a02c8 |
hex | 1843994be5 |
104213335013 has 4 divisors (see below), whose sum is σ = 104334092928. Its totient is φ = 104092577100.
The previous prime is 104213335003. The next prime is 104213335147. The reversal of 104213335013 is 310533312401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310533312401 = 13 ⋅23887177877.
It is a cyclic number.
It is not a de Polignac number, because 104213335013 - 216 = 104213269477 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 (104213335003) 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, 60377663 + ... + 60379388.
It is an arithmetic number, because the mean of its divisors is an integer number (26083523232).
Almost surely, 2104213335013 is an apocalyptic number.
It is an amenable number.
104213335013 is a deficient number, since it is larger than the sum of its proper divisors (120757915).
104213335013 is an equidigital number, since it uses as much as digits as its factorization.
104213335013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120757914.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 104213335013 its reverse (310533312401), we get a palindrome (414746647414).
The spelling of 104213335013 in words is "one hundred four billion, two hundred thirteen million, three hundred thirty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •