Base | Representation |
---|---|
bin | 100100110000101010111… |
… | …0111100101000001001001 |
3 | 122212222221000111220112111 |
4 | 1021201111313211001021 |
5 | 1130234123434014001 |
6 | 14425001010142321 |
7 | 1031006152615435 |
oct | 111412567450111 |
9 | 18788830456474 |
10 | 5052322173001 |
11 | 1678750175554 |
12 | 6972105819a1 |
13 | 2a857cc7064c |
14 | 1367686779c5 |
15 | 8b650db7851 |
hex | 49855de5049 |
5052322173001 has 2 divisors, whose sum is σ = 5052322173002. Its totient is φ = 5052322173000.
The previous prime is 5052322172999. The next prime is 5052322173011. The reversal of 5052322173001 is 1003712232505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4681835700025 + 370486472976 = 2163755^2 + 608676^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052322173001 - 21 = 5052322172999 is a prime.
It is a super-3 number, since 3×50523221730013 (a number of 39 digits) contains 333 as substring.
Together with 5052322172999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5052322173011) 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, 2526161086500 + 2526161086501.
It is an arithmetic number, because the mean of its divisors is an integer number (2526161086501).
Almost surely, 25052322173001 is an apocalyptic number.
It is an amenable number.
5052322173001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052322173001 is an equidigital number, since it uses as much as digits as its factorization.
5052322173001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 31.
The spelling of 5052322173001 in words is "five trillion, fifty-two billion, three hundred twenty-two million, one hundred seventy-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •