Base | Representation |
---|---|
bin | 1011010101110101… |
… | …0000000011010101 |
3 | 21212011110200220021 |
4 | 2311131100003111 |
5 | 22213323002041 |
6 | 1222030505141 |
7 | 135304332355 |
oct | 26535200325 |
9 | 7764420807 |
10 | 3044344021 |
11 | 13224a87a4 |
12 | 70b6651b1 |
13 | 39693c3c4 |
14 | 20c46ab65 |
15 | 12c402cd1 |
hex | b57500d5 |
3044344021 has 2 divisors, whose sum is σ = 3044344022. Its totient is φ = 3044344020.
The previous prime is 3044344007. The next prime is 3044344033. The reversal of 3044344021 is 1204434403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1873677796 + 1170666225 = 43286^2 + 34215^2 .
It is an emirp because it is prime and its reverse (1204434403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3044344021 - 213 = 3044335829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3044344001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1522172010 + 1522172011.
It is an arithmetic number, because the mean of its divisors is an integer number (1522172011).
Almost surely, 23044344021 is an apocalyptic number.
It is an amenable number.
3044344021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3044344021 is an equidigital number, since it uses as much as digits as its factorization.
3044344021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 25.
The square root of 3044344021 is about 55175.5744963294. The cubic root of 3044344021 is about 1449.3209695767.
Adding to 3044344021 its reverse (1204434403), we get a palindrome (4248778424).
It can be divided in two parts, 304434402 and 1, that added together give a palindrome (304434403).
The spelling of 3044344021 in words is "three billion, forty-four million, three hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •