Base | Representation |
---|---|
bin | 1111010110100111… |
… | …1100011100110111 |
3 | 101122020011111100220 |
4 | 3311221330130313 |
5 | 31420040212211 |
6 | 1520544105423 |
7 | 204063302412 |
oct | 36551743467 |
9 | 11566144326 |
10 | 4121413431 |
11 | 1825480a03 |
12 | 970305273 |
13 | 508b21a95 |
14 | 2b151ab79 |
15 | 191c59806 |
hex | f5a7c737 |
4121413431 has 4 divisors (see below), whose sum is σ = 5495217912. Its totient is φ = 2747608952.
The previous prime is 4121413397. The next prime is 4121413459. The reversal of 4121413431 is 1343141214.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4121413431 - 211 = 4121411383 is a prime.
It is a super-2 number, since 2×41214134312 = 33972097338454383522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4121413031) 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, 686902236 + ... + 686902241.
It is an arithmetic number, because the mean of its divisors is an integer number (1373804478).
Almost surely, 24121413431 is an apocalyptic number.
4121413431 is a deficient number, since it is larger than the sum of its proper divisors (1373804481).
4121413431 is a wasteful number, since it uses less digits than its factorization.
4121413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373804480.
The product of its digits is 1152, while the sum is 24.
The square root of 4121413431 is about 64198.2354196749. The cubic root of 4121413431 is about 1603.3022203938.
Adding to 4121413431 its reverse (1343141214), we get a palindrome (5464554645).
It can be divided in two parts, 41214 and 13431, that added together give a palindrome (54645).
The spelling of 4121413431 in words is "four billion, one hundred twenty-one million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •