Base | Representation |
---|---|
bin | 10100001010110000010100… |
… | …00001110101110010001101 |
3 | 12211000211002210102000022211 |
4 | 22011120022001311302031 |
5 | 21303112300120144401 |
6 | 234154035312510421 |
7 | 12225116233500505 |
oct | 1205301201656215 |
9 | 184024083360284 |
10 | 44350000553101 |
11 | 131498031235a1 |
12 | 4b833b154b411 |
13 | 1b992580c6499 |
14 | ad47a1392a05 |
15 | 51d9a2cd9951 |
hex | 28560a075c8d |
44350000553101 has 2 divisors, whose sum is σ = 44350000553102. Its totient is φ = 44350000553100.
The previous prime is 44350000553041. The next prime is 44350000553141. The reversal of 44350000553101 is 10135500005344.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40501145130601 + 3848855422500 = 6364051^2 + 1961850^2 .
It is a cyclic number.
It is not a de Polignac number, because 44350000553101 - 213 = 44350000544909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44350000553141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22175000276550 + 22175000276551.
It is an arithmetic number, because the mean of its divisors is an integer number (22175000276551).
Almost surely, 244350000553101 is an apocalyptic number.
It is an amenable number.
44350000553101 is a deficient number, since it is larger than the sum of its proper divisors (1).
44350000553101 is an equidigital number, since it uses as much as digits as its factorization.
44350000553101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 44350000553101 its reverse (10135500005344), we get a palindrome (54485500558445).
The spelling of 44350000553101 in words is "forty-four trillion, three hundred fifty billion, five hundred fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •