Base | Representation |
---|---|
bin | 111100101110101101011… |
… | …011110110100001101101 |
3 | 112202222002001111120121011 |
4 | 330232231123312201231 |
5 | 1021333431142112023 |
6 | 12513110443305221 |
7 | 610340556143452 |
oct | 74565533664155 |
9 | 15688061446534 |
10 | 4173323004013 |
11 | 1369995045949 |
12 | 57499951b211 |
13 | 24370932a687 |
14 | 105dc045d829 |
15 | 738573ee50d |
hex | 3cbad6f686d |
4173323004013 has 2 divisors, whose sum is σ = 4173323004014. Its totient is φ = 4173323004012.
The previous prime is 4173323004001. The next prime is 4173323004031. The reversal of 4173323004013 is 3104003233714.
Together with next prime (4173323004031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3783343986724 + 389979017289 = 1945082^2 + 624483^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4173323004013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4173323004713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2086661502006 + 2086661502007.
It is an arithmetic number, because the mean of its divisors is an integer number (2086661502007).
Almost surely, 24173323004013 is an apocalyptic number.
It is an amenable number.
4173323004013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4173323004013 is an equidigital number, since it uses as much as digits as its factorization.
4173323004013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144, while the sum is 31.
Adding to 4173323004013 its reverse (3104003233714), we get a palindrome (7277326237727).
The spelling of 4173323004013 in words is "four trillion, one hundred seventy-three billion, three hundred twenty-three million, four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •