Base | Representation |
---|---|
bin | 1001110000001011… |
… | …11100110011010000 |
3 | 111111220112221212110 |
4 | 10320011330303100 |
5 | 41210412114102 |
6 | 2223322425320 |
7 | 243516462153 |
oct | 47005746320 |
9 | 14456487773 |
10 | 5236051152 |
11 | 2247683802 |
12 | 1021662240 |
13 | 655a29227 |
14 | 379589c9a |
15 | 209a3286c |
hex | 13817ccd0 |
5236051152 has 80 divisors (see below), whose sum is σ = 14371223040. Its totient is φ = 1639604736.
The previous prime is 5236051127. The next prime is 5236051159. The reversal of 5236051152 is 2511506325.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5236051159) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 673 + ... + 102335.
It is an arithmetic number, because the mean of its divisors is an integer number (179640288).
Almost surely, 25236051152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5236051152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7185611520).
5236051152 is an abundant number, since it is smaller than the sum of its proper divisors (9135171888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5236051152 is a wasteful number, since it uses less digits than its factorization.
5236051152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101740 (or 101734 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 5236051152 is about 72360.5635135603. The cubic root of 5236051152 is about 1736.4727010937.
Adding to 5236051152 its reverse (2511506325), we get a palindrome (7747557477).
The spelling of 5236051152 in words is "five billion, two hundred thirty-six million, fifty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •