Base | Representation |
---|---|
bin | 100001100100110010… |
… | …010011000010010110 |
3 | 10110001102122112010100 |
4 | 201210302103002112 |
5 | 1042312431121032 |
6 | 24321134234530 |
7 | 2414240266461 |
oct | 414462230226 |
9 | 113042575110 |
10 | 36050645142 |
11 | 1431a716306 |
12 | 6ba1355a46 |
13 | 3526ab3ab5 |
14 | 1a5dc7c2d8 |
15 | e0ee1797c |
hex | 864c93096 |
36050645142 has 96 divisors (see below), whose sum is σ = 82999051200. Its totient is φ = 11285277696.
The previous prime is 36050645131. The next prime is 36050645149. The reversal of 36050645142 is 24154605063.
36050645142 is a `hidden beast` number, since 3 + 6 + 0 + 5 + 0 + 645 + 1 + 4 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 36050645097 and 36050645106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36050645149) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6918234 + ... + 6923442.
It is an arithmetic number, because the mean of its divisors is an integer number (864573450).
Almost surely, 236050645142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 36050645142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41499525600).
36050645142 is an abundant number, since it is smaller than the sum of its proper divisors (46948406058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36050645142 is a wasteful number, since it uses less digits than its factorization.
36050645142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5542 (or 5539 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 36050645142 in words is "thirty-six billion, fifty million, six hundred forty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •