Base | Representation |
---|---|
bin | 11101110110010110… |
… | …011011111011100110 |
3 | 10001201122102012012111 |
4 | 131312112123323212 |
5 | 1011114343123014 |
6 | 22420154311234 |
7 | 2213144412565 |
oct | 356626337346 |
9 | 101648365174 |
10 | 32050364134 |
11 | 1265765aa48 |
12 | 626572851a |
13 | 303a0c4509 |
14 | 17a0893bdc |
15 | c78b392c4 |
hex | 77659bee6 |
32050364134 has 8 divisors (see below), whose sum is σ = 49626370368. Its totient is φ = 15508240680.
The previous prime is 32050364131. The next prime is 32050364167. The reversal of 32050364134 is 43146305023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×320503641342 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 32050364096 and 32050364105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32050364131) 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 3 ways as a sum of consecutive naturals, for example, 258470617 + ... + 258470740.
It is an arithmetic number, because the mean of its divisors is an integer number (6203296296).
Almost surely, 232050364134 is an apocalyptic number.
32050364134 is a deficient number, since it is larger than the sum of its proper divisors (17576006234).
32050364134 is a wasteful number, since it uses less digits than its factorization.
32050364134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516941390.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 32050364134 its reverse (43146305023), we get a palindrome (75196669157).
The spelling of 32050364134 in words is "thirty-two billion, fifty million, three hundred sixty-four thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •