Base | Representation |
---|---|
bin | 1001011011010010… |
… | …01101101111111000 |
3 | 111001200200112201122 |
4 | 10231221031233320 |
5 | 40331022334412 |
6 | 2154101204412 |
7 | 236260430123 |
oct | 45551155770 |
9 | 14050615648 |
10 | 5060746232 |
11 | 2167728603 |
12 | b92a00708 |
13 | 62860a3c9 |
14 | 3601953ba |
15 | 1e9455572 |
hex | 12da4dbf8 |
5060746232 has 8 divisors (see below), whose sum is σ = 9488899200. Its totient is φ = 2530373112.
The previous prime is 5060746231. The next prime is 5060746247. The reversal of 5060746232 is 2326470605.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×50607462322 = 51222304849404395648, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5060746192 and 5060746201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5060746231) 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 as a sum of consecutive naturals, namely, 316296632 + ... + 316296647.
It is an arithmetic number, because the mean of its divisors is an integer number (1186112400).
Almost surely, 25060746232 is an apocalyptic number.
It is an amenable number.
5060746232 is a deficient number, since it is larger than the sum of its proper divisors (4428152968).
5060746232 is a wasteful number, since it uses less digits than its factorization.
5060746232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632593285 (or 632593281 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 35.
The square root of 5060746232 is about 71138.9220609927. The cubic root of 5060746232 is about 1716.8730630819.
The spelling of 5060746232 in words is "five billion, sixty million, seven hundred forty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •