Base | Representation |
---|---|
bin | 1001100101001001… |
… | …01000110110111110 |
3 | 111021110021110011010 |
4 | 10302210220312332 |
5 | 41013204321023 |
6 | 2210213340050 |
7 | 241313312301 |
oct | 46244506676 |
9 | 14243243133 |
10 | 5143432638 |
11 | 21aa374083 |
12 | bb6637626 |
13 | 63c79b486 |
14 | 36b15ab38 |
15 | 20183a093 |
hex | 132928dbe |
5143432638 has 32 divisors (see below), whose sum is σ = 10785053952. Its totient is φ = 1632153600.
The previous prime is 5143432633. The next prime is 5143432649. The reversal of 5143432638 is 8362343415.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 5143432596 and 5143432605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5143432633) by changing a digit.
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, 59203 + ... + 117438.
It is an arithmetic number, because the mean of its divisors is an integer number (337032936).
Almost surely, 25143432638 is an apocalyptic number.
5143432638 is an abundant number, since it is smaller than the sum of its proper divisors (5641621314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5143432638 is a wasteful number, since it uses less digits than its factorization.
5143432638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176880.
The product of its digits is 207360, while the sum is 39.
The square root of 5143432638 is about 71717.7288959989. The cubic root of 5143432638 is about 1726.1731305041.
The spelling of 5143432638 in words is "five billion, one hundred forty-three million, four hundred thirty-two thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •