Base | Representation |
---|---|
bin | 11111111101110001… |
… | …010001101010100101 |
3 | 10021120222111201102010 |
4 | 133331301101222211 |
5 | 1030243003333013 |
6 | 23433434304433 |
7 | 2323352640636 |
oct | 377561215245 |
9 | 107528451363 |
10 | 34322324133 |
11 | 1361306a139 |
12 | 679a588119 |
13 | 330c9cc846 |
14 | 193850388d |
15 | d5d31c7c3 |
hex | 7fdc51aa5 |
34322324133 has 8 divisors (see below), whose sum is σ = 46037130048. Its totient is φ = 22744533824.
The previous prime is 34322324123. The next prime is 34322324143. The reversal of 34322324133 is 33142322343.
It is an interprime number because it is at equal distance from previous prime (34322324123) and next prime (34322324143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 34322324133 - 24 = 34322324117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 34322324133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34322324123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34253316 + ... + 34254317.
It is an arithmetic number, because the mean of its divisors is an integer number (5754641256).
Almost surely, 234322324133 is an apocalyptic number.
It is an amenable number.
34322324133 is a deficient number, since it is larger than the sum of its proper divisors (11714805915).
34322324133 is a wasteful number, since it uses less digits than its factorization.
34322324133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68507803.
The product of its digits is 31104, while the sum is 30.
Adding to 34322324133 its reverse (33142322343), we get a palindrome (67464646476).
The spelling of 34322324133 in words is "thirty-four billion, three hundred twenty-two million, three hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •