Base | Representation |
---|---|
bin | 11111101101100111… |
… | …000100101100110101 |
3 | 10020220002100220102000 |
4 | 133231213010230311 |
5 | 1024214102323013 |
6 | 23350511405513 |
7 | 2313551354526 |
oct | 375547045465 |
9 | 106802326360 |
10 | 34051214133 |
11 | 13494028192 |
12 | 6723823899 |
13 | 32987a8721 |
14 | 19104d084d |
15 | d44618973 |
hex | 7ed9c4b35 |
34051214133 has 32 divisors (see below), whose sum is σ = 53305958400. Its totient is φ = 21438928368.
The previous prime is 34051214107. The next prime is 34051214147. The reversal of 34051214133 is 33141215043.
It is a happy number.
34051214133 is a `hidden beast` number, since 3 + 4 + 0 + 512 + 14 + 133 = 666.
It is not a de Polignac number, because 34051214133 - 25 = 34051214101 is a prime.
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 = 34051214097 and 34051214106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34051214333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 297985 + ... + 396102.
It is an arithmetic number, because the mean of its divisors is an integer number (1665811200).
Almost surely, 234051214133 is an apocalyptic number.
It is an amenable number.
34051214133 is a deficient number, since it is larger than the sum of its proper divisors (19254744267).
34051214133 is a wasteful number, since it uses less digits than its factorization.
34051214133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694198 (or 694192 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 34051214133 its reverse (33141215043), we get a palindrome (67192429176).
The spelling of 34051214133 in words is "thirty-four billion, fifty-one million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •