Base | Representation |
---|---|
bin | 100100101001001000011… |
… | …1000100111110001101001 |
3 | 122211110010201122220101111 |
4 | 1021102100320213301221 |
5 | 1130002444400324001 |
6 | 14413322311550321 |
7 | 1026564025242325 |
oct | 111222070476151 |
9 | 18743121586344 |
10 | 5036132433001 |
11 | 16718a251523a |
12 | 69405268b3a1 |
13 | 2a6b9cab3137 |
14 | 135a70434985 |
15 | 8b0048e2851 |
hex | 49490e27c69 |
5036132433001 has 8 divisors (see below), whose sum is σ = 5330950130880. Its totient is φ = 4749391932432.
The previous prime is 5036132432921. The next prime is 5036132433043. The reversal of 5036132433001 is 1003342316305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5036132433001 - 227 = 5035998215273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5036132433401) 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 7 ways as a sum of consecutive naturals, for example, 2019298045 + ... + 2019300538.
It is an arithmetic number, because the mean of its divisors is an integer number (666368766360).
Almost surely, 25036132433001 is an apocalyptic number.
It is an amenable number.
5036132433001 is a deficient number, since it is larger than the sum of its proper divisors (294817697879).
5036132433001 is a wasteful number, since it uses less digits than its factorization.
5036132433001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4038598655.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 5036132433001 its reverse (1003342316305), we get a palindrome (6039474749306).
The spelling of 5036132433001 in words is "five trillion, thirty-six billion, one hundred thirty-two million, four hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •