Base | Representation |
---|---|
bin | 1111010110100111… |
… | …1110110010110111 |
3 | 101122020011222112110 |
4 | 3311221332302313 |
5 | 31420041014111 |
6 | 1520544222103 |
7 | 204063342405 |
oct | 36551766267 |
9 | 11566158473 |
10 | 4121423031 |
11 | 1825488140 |
12 | 97030a933 |
13 | 508b2626b |
14 | 2b1520475 |
15 | 191c5c5a6 |
hex | f5a7ecb7 |
4121423031 has 8 divisors (see below), whose sum is σ = 5994797184. Its totient is φ = 2497832120.
The previous prime is 4121423029. The next prime is 4121423041. The reversal of 4121423031 is 1303241214.
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 4121423031 - 21 = 4121423029 is a prime.
It is a super-2 number, since 2×41214230312 = 33972255600914453922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4121422989 and 4121423007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4121423011) 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, 62445771 + ... + 62445836.
It is an arithmetic number, because the mean of its divisors is an integer number (749349648).
Almost surely, 24121423031 is an apocalyptic number.
4121423031 is a deficient number, since it is larger than the sum of its proper divisors (1873374153).
4121423031 is a wasteful number, since it uses less digits than its factorization.
4121423031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124891621.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 4121423031 is about 64198.3101880416. The cubic root of 4121423031 is about 1603.3034652491.
Adding to 4121423031 its reverse (1303241214), we get a palindrome (5424664245).
The spelling of 4121423031 in words is "four billion, one hundred twenty-one million, four hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •