Base | Representation |
---|---|
bin | 11111101011110000… |
… | …100011010000000101 |
3 | 10020210220220101101021 |
4 | 133223300203100011 |
5 | 1024133124103013 |
6 | 23343441431141 |
7 | 2313023311453 |
oct | 375360432005 |
9 | 106726811337 |
10 | 34020144133 |
11 | 134785368a8 |
12 | 671533b4b1 |
13 | 329221a701 |
14 | 190a3239d3 |
15 | d41a2ca8d |
hex | 7ebc23405 |
34020144133 has 16 divisors (see below), whose sum is σ = 36965179440. Its totient is φ = 31182745600.
The previous prime is 34020144131. The next prime is 34020144143. The reversal of 34020144133 is 33144102043.
It can be written as a sum of positive squares in 8 ways, for example, as 146845924 + 33873298209 = 12118^2 + 184047^2 .
It is a cyclic number.
It is not a de Polignac number, because 34020144133 - 21 = 34020144131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34020144098 and 34020144107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34020144131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 353703 + ... + 439483.
It is an arithmetic number, because the mean of its divisors is an integer number (2310323715).
Almost surely, 234020144133 is an apocalyptic number.
It is an amenable number.
34020144133 is a deficient number, since it is larger than the sum of its proper divisors (2945035307).
34020144133 is a wasteful number, since it uses less digits than its factorization.
34020144133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86408.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 34020144133 its reverse (33144102043), we get a palindrome (67164246176).
The spelling of 34020144133 in words is "thirty-four billion, twenty million, one hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •