Base | Representation |
---|---|
bin | 10100001111011110011100… |
… | …00000111111100010101101 |
3 | 12211121022202220220101011211 |
4 | 22013233032000333202231 |
5 | 21313241442312031323 |
6 | 234400342402314421 |
7 | 12242620605064423 |
oct | 1207571600774255 |
9 | 184538686811154 |
10 | 44512202455213 |
11 | 13201578945369 |
12 | 4baa91a658a11 |
13 | 1bab6375ac45c |
14 | adc58b4bb113 |
15 | 522ce7c1c70d |
hex | 287bce03f8ad |
44512202455213 has 2 divisors, whose sum is σ = 44512202455214. Its totient is φ = 44512202455212.
The previous prime is 44512202455211. The next prime is 44512202455261. The reversal of 44512202455213 is 31255420221544.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32710930106409 + 11801272348804 = 5719347^2 + 3435298^2 .
It is a cyclic number.
It is not a de Polignac number, because 44512202455213 - 21 = 44512202455211 is a prime.
Together with 44512202455211, 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 (44512202455211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22256101227606 + 22256101227607.
It is an arithmetic number, because the mean of its divisors is an integer number (22256101227607).
Almost surely, 244512202455213 is an apocalyptic number.
It is an amenable number.
44512202455213 is a deficient number, since it is larger than the sum of its proper divisors (1).
44512202455213 is an equidigital number, since it uses as much as digits as its factorization.
44512202455213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384000, while the sum is 40.
Adding to 44512202455213 its reverse (31255420221544), we get a palindrome (75767622676757).
The spelling of 44512202455213 in words is "forty-four trillion, five hundred twelve billion, two hundred two million, four hundred fifty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •