Base | Representation |
---|---|
bin | 1001101110010101010… |
… | …11111100111100100101 |
3 | 1011221101220120001010222 |
4 | 10313022223330330211 |
5 | 20433230412020003 |
6 | 413253413054125 |
7 | 33065426436443 |
oct | 4671253747445 |
9 | 1157356501128 |
10 | 334113001253 |
11 | 119773096019 |
12 | 54905927345 |
13 | 2567835b855 |
14 | 12257917b93 |
15 | 8a5742ec38 |
hex | 4dcaafcf25 |
334113001253 has 2 divisors, whose sum is σ = 334113001254. Its totient is φ = 334113001252.
The previous prime is 334113001237. The next prime is 334113001259. The reversal of 334113001253 is 352100311433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 295042339684 + 39070661569 = 543178^2 + 197663^2 .
It is a cyclic number.
It is not a de Polignac number, because 334113001253 - 24 = 334113001237 is a prime.
It is a super-2 number, since 2×3341130012532 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (334113001259) 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, 167056500626 + 167056500627.
It is an arithmetic number, because the mean of its divisors is an integer number (167056500627).
Almost surely, 2334113001253 is an apocalyptic number.
It is an amenable number.
334113001253 is a deficient number, since it is larger than the sum of its proper divisors (1).
334113001253 is an equidigital number, since it uses as much as digits as its factorization.
334113001253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 334113001253 its reverse (352100311433), we get a palindrome (686213312686).
The spelling of 334113001253 in words is "three hundred thirty-four billion, one hundred thirteen million, one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.322 sec. • engine limits •