Base | Representation |
---|---|
bin | 1001010111111000… |
… | …11100111000100100 |
3 | 110222201001000000202 |
4 | 10223330130320210 |
5 | 40301223001112 |
6 | 2151202130032 |
7 | 235463200463 |
oct | 45374347044 |
9 | 13881030022 |
10 | 5032234532 |
11 | 2152624316 |
12 | b85350918 |
13 | 622736990 |
14 | 35a4929da |
15 | 1e6bc26c2 |
hex | 12bf1ce24 |
5032234532 has 24 divisors (see below), whose sum is σ = 10041700536. Its totient is φ = 2185947648.
The previous prime is 5032234517. The next prime is 5032234567. The reversal of 5032234532 is 2354322305.
It can be written as a sum of positive squares in 4 ways, for example, as 705752356 + 4326482176 = 26566^2 + 65776^2 .
It is a junction number, because it is equal to n+sod(n) for n = 5032234495 and 5032234504.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2845403 + ... + 2847170.
It is an arithmetic number, because the mean of its divisors is an integer number (418404189).
Almost surely, 25032234532 is an apocalyptic number.
5032234532 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5032234532 is a deficient number, since it is larger than the sum of its proper divisors (5009466004).
5032234532 is a wasteful number, since it uses less digits than its factorization.
5032234532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5692607 (or 5692605 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 29.
The square root of 5032234532 is about 70938.2444947716. The cubic root of 5032234532 is about 1713.6427630138.
Adding to 5032234532 its reverse (2354322305), we get a palindrome (7386556837).
The spelling of 5032234532 in words is "five billion, thirty-two million, two hundred thirty-four thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •