Base | Representation |
---|---|
bin | 110000101010101110110… |
… | …111011011001111111001 |
3 | 102211201112021002211020002 |
4 | 300222232313123033321 |
5 | 414243332042241101 |
6 | 11040223215242345 |
7 | 463424542453643 |
oct | 60525667331771 |
9 | 12751467084202 |
10 | 3344418321401 |
11 | 107a3a5a54303 |
12 | 460206b193b5 |
13 | 1b34b9bba411 |
14 | b7c2932d893 |
15 | 5bee1741d6b |
hex | 30aaeddb3f9 |
3344418321401 has 2 divisors, whose sum is σ = 3344418321402. Its totient is φ = 3344418321400.
The previous prime is 3344418321397. The next prime is 3344418321487. The reversal of 3344418321401 is 1041238144433.
3344418321401 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2184971767225 + 1159446554176 = 1478165^2 + 1076776^2 .
It is a cyclic number.
It is not a de Polignac number, because 3344418321401 - 22 = 3344418321397 is a prime.
It is a super-2 number, since 2×33444183214012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3344418321901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1672209160700 + 1672209160701.
It is an arithmetic number, because the mean of its divisors is an integer number (1672209160701).
Almost surely, 23344418321401 is an apocalyptic number.
It is an amenable number.
3344418321401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3344418321401 is an equidigital number, since it uses as much as digits as its factorization.
3344418321401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 110592, while the sum is 38.
The spelling of 3344418321401 in words is "three trillion, three hundred forty-four billion, four hundred eighteen million, three hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •