Base | Representation |
---|---|
bin | 1001101111000100110… |
… | …10001101110101110001 |
3 | 1011222102122110201201000 |
4 | 10313202122031311301 |
5 | 20440034304130131 |
6 | 413401111432213 |
7 | 33111331425363 |
oct | 4674232156561 |
9 | 1158378421630 |
10 | 334511005041 |
11 | 119957818174 |
12 | 549b7085669 |
13 | 2570c951655 |
14 | 1229471cd33 |
15 | 8a7c34bce6 |
hex | 4de268dd71 |
334511005041 has 64 divisors (see below), whose sum is σ = 517800003840. Its totient is φ = 213230983680.
The previous prime is 334511005033. The next prime is 334511005051. The reversal of 334511005041 is 140500115433.
It is a happy number.
334511005041 is a `hidden beast` number, since 3 + 3 + 4 + 51 + 100 + 504 + 1 = 666.
It is not a de Polignac number, because 334511005041 - 23 = 334511005033 is a prime.
It is a super-2 number, since 2×3345110050412 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 334511004996 and 334511005014.
It is not an unprimeable number, because it can be changed into a prime (334511005021) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 65884995 + ... + 65890071.
It is an arithmetic number, because the mean of its divisors is an integer number (8090625060).
Almost surely, 2334511005041 is an apocalyptic number.
It is an amenable number.
334511005041 is a deficient number, since it is larger than the sum of its proper divisors (183288998799).
334511005041 is a wasteful number, since it uses less digits than its factorization.
334511005041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6303 (or 6297 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 334511005041 in words is "three hundred thirty-four billion, five hundred eleven million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •