Base | Representation |
---|---|
bin | 100100101111101100010… |
… | …1101010111001101000101 |
3 | 122212210111200022111021021 |
4 | 1021133120231113031011 |
5 | 1130220323404433411 |
6 | 14424012355351141 |
7 | 1030603134430144 |
oct | 111373055271505 |
9 | 18783450274237 |
10 | 5050222342981 |
11 | 1677872943142 |
12 | 6969252b24b1 |
13 | 2a8306c11c8a |
14 | 13660983375b |
15 | 8b57b885a71 |
hex | 497d8b57345 |
5050222342981 has 2 divisors, whose sum is σ = 5050222342982. Its totient is φ = 5050222342980.
The previous prime is 5050222342973. The next prime is 5050222342999. The reversal of 5050222342981 is 1892432220505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4205001372100 + 845220970881 = 2050610^2 + 919359^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050222342981 - 23 = 5050222342973 is a prime.
It is a super-2 number, since 2×50502223429812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050222342181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525111171490 + 2525111171491.
It is an arithmetic number, because the mean of its divisors is an integer number (2525111171491).
Almost surely, 25050222342981 is an apocalyptic number.
It is an amenable number.
5050222342981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050222342981 is an equidigital number, since it uses as much as digits as its factorization.
5050222342981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 5050222342981 in words is "five trillion, fifty billion, two hundred twenty-two million, three hundred forty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •