Base | Representation |
---|---|
bin | 1011010000010011… |
… | …0000001010010100 |
3 | 21210112211001110001 |
4 | 2310010300022110 |
5 | 22141403112344 |
6 | 1215441341044 |
7 | 134603210053 |
oct | 26404601224 |
9 | 7715731401 |
10 | 3021144724 |
11 | 13103a2824 |
12 | 703937784 |
13 | 391ba8a00 |
14 | 20934c39a |
15 | 12a36ded4 |
hex | b4130294 |
3021144724 has 36 divisors (see below), whose sum is σ = 5781793500. Its totient is φ = 1380537600.
The previous prime is 3021144719. The next prime is 3021144727. The reversal of 3021144724 is 4274411203.
It can be written as a sum of positive squares in 6 ways, for example, as 532132624 + 2489012100 = 23068^2 + 49890^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3021144692 and 3021144701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3021144727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46152 + ... + 90400.
It is an arithmetic number, because the mean of its divisors is an integer number (160605375).
Almost surely, 23021144724 is an apocalyptic number.
It is an amenable number.
3021144724 is a deficient number, since it is larger than the sum of its proper divisors (2760648776).
3021144724 is a wasteful number, since it uses less digits than its factorization.
3021144724 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44380 (or 44365 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 28.
The square root of 3021144724 is about 54964.9408623351. The cubic root of 3021144724 is about 1445.6300814954.
Adding to 3021144724 its reverse (4274411203), we get a palindrome (7295555927).
The spelling of 3021144724 in words is "three billion, twenty-one million, one hundred forty-four thousand, seven hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •