Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0001111001101100 |
3 | 21211020120111210110 |
4 | 2310222301321230 |
5 | 22201431111244 |
6 | 1220435140020 |
7 | 135054016041 |
oct | 26452617154 |
9 | 7736514713 |
10 | 3031113324 |
11 | 1315a91338 |
12 | 707144610 |
13 | 393c891a5 |
14 | 20a7c51c8 |
15 | 12b18c9b9 |
hex | b4ab1e6c |
3031113324 has 48 divisors (see below), whose sum is σ = 7108012800. Its totient is φ = 1005327936.
The previous prime is 3031113307. The next prime is 3031113341. The reversal of 3031113324 is 4233111303.
It is an interprime number because it is at equal distance from previous prime (3031113307) and next prime (3031113341).
It is a self number, because there is not a number n which added to its sum of digits gives 3031113324.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2974087 + ... + 2975105.
It is an arithmetic number, because the mean of its divisors is an integer number (148083600).
Almost surely, 23031113324 is an apocalyptic number.
It is an amenable number.
3031113324 is an abundant number, since it is smaller than the sum of its proper divisors (4076899476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3031113324 is a wasteful number, since it uses less digits than its factorization.
3031113324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2022 (or 2020 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 3031113324 is about 55055.5476223786. The cubic root of 3031113324 is about 1447.2183411575.
Adding to 3031113324 its reverse (4233111303), we get a palindrome (7264224627).
The spelling of 3031113324 in words is "three billion, thirty-one million, one hundred thirteen thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •