Base | Representation |
---|---|
bin | 1111010110100111… |
… | …1100101100010101 |
3 | 101122020011112201120 |
4 | 3311221330230111 |
5 | 31420040230141 |
6 | 1520544114153 |
7 | 204063305325 |
oct | 36551745425 |
9 | 11566145646 |
10 | 4121414421 |
11 | 1825481723 |
12 | 970305959 |
13 | 508b22377 |
14 | 2b151b285 |
15 | 191c59c66 |
hex | f5a7cb15 |
4121414421 has 8 divisors (see below), whose sum is σ = 5623015200. Its totient is φ = 2683711632.
The previous prime is 4121414419. The next prime is 4121414467. The reversal of 4121414421 is 1244141214.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4121414421 - 21 = 4121414419 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4121414391 and 4121414400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4121414471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15974346 + ... + 15974603.
It is an arithmetic number, because the mean of its divisors is an integer number (702876900).
Almost surely, 24121414421 is an apocalyptic number.
It is an amenable number.
4121414421 is a deficient number, since it is larger than the sum of its proper divisors (1501600779).
4121414421 is a wasteful number, since it uses less digits than its factorization.
4121414421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31948995.
The product of its digits is 1024, while the sum is 24.
The square root of 4121414421 is about 64198.2431301667. The cubic root of 4121414421 is about 1603.3023487696.
Adding to 4121414421 its reverse (1244141214), we get a palindrome (5365555635).
The spelling of 4121414421 in words is "four billion, one hundred twenty-one million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •