Base | Representation |
---|---|
bin | 110000101101111101… |
… | …0101000011000001101 |
3 | 101000001020110021211221 |
4 | 1201123322220120031 |
5 | 3203231023432001 |
6 | 120021245443341 |
7 | 10362420321610 |
oct | 1413372503015 |
9 | 330036407757 |
10 | 104621311501 |
11 | 40408003903 |
12 | 18339570551 |
13 | 9b3407c0a5 |
14 | 50c6b08177 |
15 | 2ac4cdc1a1 |
hex | 185bea860d |
104621311501 has 4 divisors (see below), whose sum is σ = 119567213152. Its totient is φ = 89675409852.
The previous prime is 104621311493. The next prime is 104621311519. The reversal of 104621311501 is 105113126401.
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: 105113126401 = 273787 ⋅383923.
It is not a de Polignac number, because 104621311501 - 23 = 104621311493 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 (104621321501) 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, 7472950815 + ... + 7472950828.
It is an arithmetic number, because the mean of its divisors is an integer number (29891803288).
Almost surely, 2104621311501 is an apocalyptic number.
It is an amenable number.
104621311501 is a deficient number, since it is larger than the sum of its proper divisors (14945901651).
104621311501 is an equidigital number, since it uses as much as digits as its factorization.
104621311501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14945901650.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 104621311501 its reverse (105113126401), we get a palindrome (209734437902).
The spelling of 104621311501 in words is "one hundred four billion, six hundred twenty-one million, three hundred eleven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •