Base | Representation |
---|---|
bin | 101100010011000011010… |
… | …010011011111010100101 |
3 | 101210000101111002211110122 |
4 | 230103003102123322211 |
5 | 344333320442014441 |
6 | 10250240223131325 |
7 | 432633651400343 |
oct | 54230322337245 |
9 | 11700344084418 |
10 | 3044113235621 |
11 | a7400161a5a7 |
12 | 411b77443b45 |
13 | 19109baccba3 |
14 | a749b892993 |
15 | 542b73bc34b |
hex | 2c4c349bea5 |
3044113235621 has 2 divisors, whose sum is σ = 3044113235622. Its totient is φ = 3044113235620.
The previous prime is 3044113235587. The next prime is 3044113235629. The reversal of 3044113235621 is 1265323114403.
3044113235621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1754273760100 + 1289839475521 = 1324490^2 + 1135711^2 .
It is an emirp because it is prime and its reverse (1265323114403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3044113235621 - 210 = 3044113234597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3044113235629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1522056617810 + 1522056617811.
It is an arithmetic number, because the mean of its divisors is an integer number (1522056617811).
Almost surely, 23044113235621 is an apocalyptic number.
It is an amenable number.
3044113235621 is a deficient number, since it is larger than the sum of its proper divisors (1).
3044113235621 is an equidigital number, since it uses as much as digits as its factorization.
3044113235621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 3044113235621 in words is "three trillion, forty-four billion, one hundred thirteen million, two hundred thirty-five thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •