Base | Representation |
---|---|
bin | 1010101011011011… |
… | …01010110110001000 |
3 | 112210112122201010211 |
4 | 11111231222312020 |
5 | 43220122041012 |
6 | 2344514050504 |
7 | 262032501250 |
oct | 52555526610 |
9 | 15715581124 |
10 | 5733002632 |
11 | 2482148805 |
12 | 113bb79a34 |
13 | 704984866 |
14 | 3c558a960 |
15 | 2384976a7 |
hex | 155b6ad88 |
5733002632 has 64 divisors (see below), whose sum is σ = 12838176000. Its totient is φ = 2346685440.
The previous prime is 5733002621. The next prime is 5733002641. The reversal of 5733002632 is 2362003375.
It is a junction number, because it is equal to n+sod(n) for n = 5733002594 and 5733002603.
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 15 ways as a sum of consecutive naturals, for example, 977244 + ... + 983092.
It is an arithmetic number, because the mean of its divisors is an integer number (200596500).
Almost surely, 25733002632 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 5733002632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6419088000).
5733002632 is an abundant number, since it is smaller than the sum of its proper divisors (7105173368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5733002632 is a wasteful number, since it uses less digits than its factorization.
5733002632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6646 (or 6642 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 31.
The square root of 5733002632 is about 75716.5941653479. The cubic root of 5733002632 is about 1789.7569067422.
The spelling of 5733002632 in words is "five billion, seven hundred thirty-three million, two thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •