Base | Representation |
---|---|
bin | 1111000110001000… |
… | …0110111000100110 |
3 | 101110102000122011220 |
4 | 3301202012320212 |
5 | 31244334001100 |
6 | 1510033441210 |
7 | 202263362244 |
oct | 36142067046 |
9 | 11412018156 |
10 | 4052250150 |
11 | 179a431573 |
12 | 951110206 |
13 | 4c76b7070 |
14 | 2a6275794 |
15 | 18ab46aa0 |
hex | f1886e26 |
4052250150 has 96 divisors (see below), whose sum is σ = 11027106720. Its totient is φ = 978631680.
The previous prime is 4052250133. The next prime is 4052250161. The reversal of 4052250150 is 510522504.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 4052250150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 83746 + ... + 122954.
It is an arithmetic number, because the mean of its divisors is an integer number (114865695).
Almost surely, 24052250150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4052250150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5513553360).
4052250150 is an abundant number, since it is smaller than the sum of its proper divisors (6974856570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4052250150 is a wasteful number, since it uses less digits than its factorization.
4052250150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39290 (or 39285 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 24.
The square root of 4052250150 is about 63657.2866999529. The cubic root of 4052250150 is about 1594.2830017347.
Adding to 4052250150 its reverse (510522504), we get a palindrome (4562772654).
The spelling of 4052250150 in words is "four billion, fifty-two million, two hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •