Base | Representation |
---|---|
bin | 1111011000111100… |
… | …0100001010000011 |
3 | 101122220110212122022 |
4 | 3312033010022003 |
5 | 31430033104243 |
6 | 1521532432055 |
7 | 204242101355 |
oct | 36617041203 |
9 | 11586425568 |
10 | 4131144323 |
11 | 182aa17969 |
12 | 97361862b |
13 | 50ab4acc7 |
14 | 2b29310d5 |
15 | 192a2cb68 |
hex | f63c4283 |
4131144323 has 4 divisors (see below), whose sum is σ = 4131272880. Its totient is φ = 4131015768.
The previous prime is 4131144247. The next prime is 4131144359. The reversal of 4131144323 is 3234411314.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 4131144323 - 28 = 4131144067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4131144292 and 4131144301.
It is not an unprimeable number, because it can be changed into a prime (4131144373) 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, 31061 + ... + 96057.
It is an arithmetic number, because the mean of its divisors is an integer number (1032818220).
Almost surely, 24131144323 is an apocalyptic number.
4131144323 is a deficient number, since it is larger than the sum of its proper divisors (128557).
4131144323 is an equidigital number, since it uses as much as digits as its factorization.
4131144323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128556.
The product of its digits is 3456, while the sum is 26.
The square root of 4131144323 is about 64273.9785838717. The cubic root of 4131144323 is about 1604.5630579169.
Adding to 4131144323 its reverse (3234411314), we get a palindrome (7365555637).
The spelling of 4131144323 in words is "four billion, one hundred thirty-one million, one hundred forty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •