Base | Representation |
---|---|
bin | 100100101000110011100… |
… | …0101010100110010101001 |
3 | 122211101022212000111212102 |
4 | 1021101213011110302221 |
5 | 1130000030331320131 |
6 | 14413124540223145 |
7 | 1026540451212200 |
oct | 111214705246251 |
9 | 18741285014772 |
10 | 5035431120041 |
11 | 1671572659453 |
12 | 693a9783aab5 |
13 | 2a6aba70425a |
14 | 135a05238237 |
15 | 8aeb30611cb |
hex | 49467154ca9 |
5035431120041 has 24 divisors (see below), whose sum is σ = 5961033635904. Its totient is φ = 4240256700960.
The previous prime is 5035431119959. The next prime is 5035431120077. The reversal of 5035431120041 is 1400211345305.
It is a de Polignac number, because none of the positive numbers 2k-5035431120041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5035431119986 and 5035431120013.
It is not an unprimeable number, because it can be changed into a prime (5035431120341) 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 23 ways as a sum of consecutive naturals, for example, 1572650 + ... + 3541763.
It is an arithmetic number, because the mean of its divisors is an integer number (248376401496).
Almost surely, 25035431120041 is an apocalyptic number.
It is an amenable number.
5035431120041 is a deficient number, since it is larger than the sum of its proper divisors (925602515863).
5035431120041 is a wasteful number, since it uses less digits than its factorization.
5035431120041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5114781 (or 5114774 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 5035431120041 its reverse (1400211345305), we get a palindrome (6435642465346).
The spelling of 5035431120041 in words is "five trillion, thirty-five billion, four hundred thirty-one million, one hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •