Base | Representation |
---|---|
bin | 1001101110010111011… |
… | …01001110110111111001 |
3 | 1011221110002202110110221 |
4 | 10313023231032313321 |
5 | 20433244302122131 |
6 | 413255223540041 |
7 | 33066025052113 |
oct | 4671355166771 |
9 | 1157402673427 |
10 | 334130114041 |
11 | 119781814119 |
12 | 5490b5ba621 |
13 | 2567ba70a69 |
14 | 12259cd03b3 |
15 | 8a58bb0411 |
hex | 4dcbb4edf9 |
334130114041 has 2 divisors, whose sum is σ = 334130114042. Its totient is φ = 334130114040.
The previous prime is 334130114011. The next prime is 334130114069. The reversal of 334130114041 is 140411031433.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193358075625 + 140772038416 = 439725^2 + 375196^2 .
It is a cyclic number.
It is not a de Polignac number, because 334130114041 - 213 = 334130105849 is a prime.
It is a super-2 number, since 2×3341301140412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 334130113997 and 334130114015.
It is not a weakly prime, because it can be changed into another prime (334130114011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167065057020 + 167065057021.
It is an arithmetic number, because the mean of its divisors is an integer number (167065057021).
Almost surely, 2334130114041 is an apocalyptic number.
It is an amenable number.
334130114041 is a deficient number, since it is larger than the sum of its proper divisors (1).
334130114041 is an equidigital number, since it uses as much as digits as its factorization.
334130114041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 334130114041 its reverse (140411031433), we get a palindrome (474541145474).
The spelling of 334130114041 in words is "three hundred thirty-four billion, one hundred thirty million, one hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •