Base | Representation |
---|---|
bin | 10100001100100000110100… |
… | …10000000000001010001101 |
3 | 12211020121000021211210022121 |
4 | 22012100122100000022031 |
5 | 21310110000433240323 |
6 | 234241505050412541 |
7 | 12232355111416426 |
oct | 1206203220001215 |
9 | 184217007753277 |
10 | 44410402243213 |
11 | 13172389320356 |
12 | 4b93049a31151 |
13 | 1ba1b62b37316 |
14 | ad769132a64d |
15 | 52033a936a5d |
hex | 28641a40028d |
44410402243213 has 2 divisors, whose sum is σ = 44410402243214. Its totient is φ = 44410402243212.
The previous prime is 44410402243211. The next prime is 44410402243217. The reversal of 44410402243213 is 31234220401444.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39635360018244 + 4775042224969 = 6295662^2 + 2185187^2 .
It is a cyclic number.
It is not a de Polignac number, because 44410402243213 - 21 = 44410402243211 is a prime.
Together with 44410402243211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44410402243211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22205201121606 + 22205201121607.
It is an arithmetic number, because the mean of its divisors is an integer number (22205201121607).
Almost surely, 244410402243213 is an apocalyptic number.
It is an amenable number.
44410402243213 is a deficient number, since it is larger than the sum of its proper divisors (1).
44410402243213 is an equidigital number, since it uses as much as digits as its factorization.
44410402243213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 73728, while the sum is 34.
Adding to 44410402243213 its reverse (31234220401444), we get a palindrome (75644622644657).
The spelling of 44410402243213 in words is "forty-four trillion, four hundred ten billion, four hundred two million, two hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.593 sec. • engine limits •