Base | Representation |
---|---|
bin | 100110000000011011010000… |
… | …0000110110100001111001001 |
3 | 1121211200201200120120110022201 |
4 | 1030000312200012310033021 |
5 | 322304313443210411022 |
6 | 3143003530324120201 |
7 | 130263050554022656 |
oct | 11400664006641711 |
9 | 1554621616513281 |
10 | 334310055560137 |
11 | 97581109a11618 |
12 | 315b3641236061 |
13 | 114703c280c977 |
14 | 5c7a99b92ac2d |
15 | 289b289987127 |
hex | 1300da01b43c9 |
334310055560137 has 16 divisors (see below), whose sum is σ = 336088304523072. Its totient is φ = 332537921130240.
The previous prime is 334310055560111. The next prime is 334310055560153. The reversal of 334310055560137 is 731065550013433.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-334310055560137 is a prime.
It is a super-2 number, since 2×3343100555601372 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (334310059560137) 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 in 15 ways as a sum of consecutive naturals, for example, 196816437 + ... + 198507757.
It is an arithmetic number, because the mean of its divisors is an integer number (21005519032692).
Almost surely, 2334310055560137 is an apocalyptic number.
It is an amenable number.
334310055560137 is a deficient number, since it is larger than the sum of its proper divisors (1778248962935).
334310055560137 is a wasteful number, since it uses less digits than its factorization.
334310055560137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1693128.
The product of its (nonzero) digits is 1701000, while the sum is 46.
The spelling of 334310055560137 in words is "three hundred thirty-four trillion, three hundred ten billion, fifty-five million, five hundred sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •