Base | Representation |
---|---|
bin | 111011101110001010111… |
… | …001001101100011100101 |
3 | 112112100012111020111112212 |
4 | 323232022321031203211 |
5 | 1014220020122134341 |
6 | 12421210153453205 |
7 | 602335353412655 |
oct | 73561271154345 |
9 | 15470174214485 |
10 | 4104024021221 |
11 | 1342563628443 |
12 | 563479411205 |
13 | 23a0141ba407 |
14 | 1028c89a8365 |
15 | 71b4d6125eb |
hex | 3bb8ae4d8e5 |
4104024021221 has 4 divisors (see below), whose sum is σ = 4114361613612. Its totient is φ = 4093686428832.
The previous prime is 4104024021211. The next prime is 4104024021239. The reversal of 4104024021221 is 1221204204014.
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 2362719448996 + 1741304572225 = 1537114^2 + 1319585^2 .
It is a cyclic number.
It is not a de Polignac number, because 4104024021221 - 26 = 4104024021157 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 (4104024021211) 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, 5168795600 + ... + 5168796393.
It is an arithmetic number, because the mean of its divisors is an integer number (1028590403403).
Almost surely, 24104024021221 is an apocalyptic number.
It is an amenable number.
4104024021221 is a deficient number, since it is larger than the sum of its proper divisors (10337592391).
4104024021221 is a wasteful number, since it uses less digits than its factorization.
4104024021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10337592390.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 4104024021221 its reverse (1221204204014), we get a palindrome (5325228225235).
The spelling of 4104024021221 in words is "four trillion, one hundred four billion, twenty-four million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •