Base | Representation |
---|---|
bin | 10111101111100010000110… |
… | …101110000100100000110001 |
3 | 111200201121011020021002222121 |
4 | 113233202012232010200301 |
5 | 102141320220302440101 |
6 | 1010030324402234241 |
7 | 30665130145453153 |
oct | 2757420656044061 |
9 | 450647136232877 |
10 | 104421505124401 |
11 | 302a9a0341a423 |
12 | b865706955981 |
13 | 4635ba0a2219a |
14 | 1bb0056474ad3 |
15 | c1139a0ec0a1 |
hex | 5ef886b84831 |
104421505124401 has 8 divisors (see below), whose sum is σ = 106784115454080. Its totient is φ = 102064764635568.
The previous prime is 104421505124389. The next prime is 104421505124423.
104421505124401 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104421505124401 - 223 = 104421496735793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104421505124491) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1467424231 + ... + 1467495388.
It is an arithmetic number, because the mean of its divisors is an integer number (13348014431760).
Almost surely, 2104421505124401 is an apocalyptic number.
It is an amenable number.
104421505124401 is a deficient number, since it is larger than the sum of its proper divisors (2362610329679).
104421505124401 is an equidigital number, since it uses as much as digits as its factorization.
104421505124401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2934920423.
The product of its (nonzero) digits is 25600, while the sum is 34.
It can be divided in two parts, 10442150 and 5124401, that added together give a palindrome (15566551).
The spelling of 104421505124401 in words is "one hundred four trillion, four hundred twenty-one billion, five hundred five million, one hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •