Base | Representation |
---|---|
bin | 111110110001011… |
… | …000001010011111 |
3 | 2201101122121201112 |
4 | 332301120022133 |
5 | 4124100201143 |
6 | 252300132235 |
7 | 35045320001 |
oct | 7661301237 |
9 | 2641577645 |
10 | 1053131423 |
11 | 4a0513253 |
12 | 25483707b |
13 | 13a2509b6 |
14 | 9dc1c371 |
15 | 626c8e18 |
hex | 3ec5829f |
1053131423 has 4 divisors (see below), whose sum is σ = 1054358280. Its totient is φ = 1051904568.
The previous prime is 1053131413. The next prime is 1053131437. The reversal of 1053131423 is 3241313501.
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 1053131423 - 216 = 1053065887 is a prime.
It is a super-2 number, since 2×10531314232 = 2218171588220009858, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053131413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 612140 + ... + 613857.
It is an arithmetic number, because the mean of its divisors is an integer number (263589570).
Almost surely, 21053131423 is an apocalyptic number.
1053131423 is a deficient number, since it is larger than the sum of its proper divisors (1226857).
1053131423 is an equidigital number, since it uses as much as digits as its factorization.
1053131423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226856.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1053131423 is about 32451.9864261034. The cubic root of 1053131423 is about 1017.4057562320.
Adding to 1053131423 its reverse (3241313501), we get a palindrome (4294444924).
The spelling of 1053131423 in words is "one billion, fifty-three million, one hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •