Base | Representation |
---|---|
bin | 1001101111001001100… |
… | …00111000011011111001 |
3 | 1011222112101210100010111 |
4 | 10313210300320123321 |
5 | 20440124412013423 |
6 | 413405042144321 |
7 | 33112321224313 |
oct | 4674460703371 |
9 | 1158471710114 |
10 | 334550501113 |
11 | 119978044154 |
12 | 54a083520a1 |
13 | 25717b9c9ca |
14 | 12299a807b3 |
15 | 8a80a4e60d |
hex | 4de4c386f9 |
334550501113 has 2 divisors, whose sum is σ = 334550501114. Its totient is φ = 334550501112.
The previous prime is 334550501101. The next prime is 334550501123. The reversal of 334550501113 is 311105055433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212671312569 + 121879188544 = 461163^2 + 349112^2 .
It is an emirp because it is prime and its reverse (311105055433) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 334550501113 - 25 = 334550501081 is a prime.
It is a super-2 number, since 2×3345505011132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (334550501123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167275250556 + 167275250557.
It is an arithmetic number, because the mean of its divisors is an integer number (167275250557).
Almost surely, 2334550501113 is an apocalyptic number.
It is an amenable number.
334550501113 is a deficient number, since it is larger than the sum of its proper divisors (1).
334550501113 is an equidigital number, since it uses as much as digits as its factorization.
334550501113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 334550501113 its reverse (311105055433), we get a palindrome (645655556546).
The spelling of 334550501113 in words is "three hundred thirty-four billion, five hundred fifty million, five hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •