Base | Representation |
---|---|
bin | 1001011011110101… |
… | …10100101110011100 |
3 | 111002000101001211022 |
4 | 10231322310232130 |
5 | 40333213043312 |
6 | 2154344143312 |
7 | 236344604132 |
oct | 45572645634 |
9 | 14060331738 |
10 | 5065362332 |
11 | 216a2a0768 |
12 | b94467b38 |
13 | 629565524 |
14 | 360a37752 |
15 | 1e9a68172 |
hex | 12deb4b9c |
5065362332 has 12 divisors (see below), whose sum is σ = 9070532856. Its totient is φ = 2473781520.
The previous prime is 5065362331. The next prime is 5065362373. The reversal of 5065362332 is 2332635605.
It is a super-4 number, since 4×50653623324 (a number of 40 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5065362292 and 5065362301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5065362331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14724719 + ... + 14725062.
It is an arithmetic number, because the mean of its divisors is an integer number (755877738).
Almost surely, 25065362332 is an apocalyptic number.
It is an amenable number.
5065362332 is a deficient number, since it is larger than the sum of its proper divisors (4005170524).
5065362332 is a wasteful number, since it uses less digits than its factorization.
5065362332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29449828 (or 29449826 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 35.
The square root of 5065362332 is about 71171.3589304012. The cubic root of 5065362332 is about 1717.3949129541.
Adding to 5065362332 its reverse (2332635605), we get a palindrome (7397997937).
The spelling of 5065362332 in words is "five billion, sixty-five million, three hundred sixty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •