Base | Representation |
---|---|
bin | 110000100111111111… |
… | …0100011011000101001 |
3 | 100222112021120002000011 |
4 | 1201033332203120221 |
5 | 3202323234404113 |
6 | 115545332411521 |
7 | 10354435652221 |
oct | 1411776433051 |
9 | 328467502004 |
10 | 104421013033 |
11 | 40314a37687 |
12 | 182a2476ba1 |
13 | 9b0171bc9c |
14 | 50a8289081 |
15 | 2ab242463d |
hex | 184ffa3629 |
104421013033 has 4 divisors (see below), whose sum is σ = 105497518420. Its totient is φ = 103344507648.
The previous prime is 104421013031. The next prime is 104421013097. The reversal of 104421013033 is 330310124401.
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 23339589529 + 81081423504 = 152773^2 + 284748^2 .
It is a cyclic number.
It is not a de Polignac number, because 104421013033 - 21 = 104421013031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104421012995 and 104421013013.
It is not an unprimeable number, because it can be changed into a prime (104421013031) 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, 538252548 + ... + 538252741.
It is an arithmetic number, because the mean of its divisors is an integer number (26374379605).
Almost surely, 2104421013033 is an apocalyptic number.
It is an amenable number.
104421013033 is a deficient number, since it is larger than the sum of its proper divisors (1076505387).
104421013033 is an equidigital number, since it uses as much as digits as its factorization.
104421013033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076505386.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 104421013033 its reverse (330310124401), we get a palindrome (434731137434).
The spelling of 104421013033 in words is "one hundred four billion, four hundred twenty-one million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •