Base | Representation |
---|---|
bin | 1001101110001100111… |
… | …01111000110011111001 |
3 | 1011221012222100020112120 |
4 | 10313012131320303321 |
5 | 20433104301033213 |
6 | 413242403431453 |
7 | 33063606616566 |
oct | 4670635706371 |
9 | 1157188306476 |
10 | 334042205433 |
11 | 119737131082 |
12 | 548a6085589 |
13 | 256667a1a31 |
14 | 1224c36986d |
15 | 8a510e8423 |
hex | 4dc6778cf9 |
334042205433 has 16 divisors (see below), whose sum is σ = 469147848000. Its totient is φ = 210831517440.
The previous prime is 334042205417. The next prime is 334042205447. The reversal of 334042205433 is 334502240433.
It is not a de Polignac number, because 334042205433 - 24 = 334042205417 is a prime.
It is a super-2 number, since 2×3340422054332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 334042205394 and 334042205403.
It is not an unprimeable number, because it can be changed into a prime (334042200433) 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 in 15 ways as a sum of consecutive naturals, for example, 1894108 + ... + 2062941.
It is an arithmetic number, because the mean of its divisors is an integer number (29321740500).
Almost surely, 2334042205433 is an apocalyptic number.
It is an amenable number.
334042205433 is a deficient number, since it is larger than the sum of its proper divisors (135105642567).
334042205433 is a wasteful number, since it uses less digits than its factorization.
334042205433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3958552.
The product of its (nonzero) digits is 103680, while the sum is 33.
Adding to 334042205433 its reverse (334502240433), we get a palindrome (668544445866).
The spelling of 334042205433 in words is "three hundred thirty-four billion, forty-two million, two hundred five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •