Base | Representation |
---|---|
bin | 100000111111110111100… |
… | …1000001101101010010101 |
3 | 121001120011001102212120221 |
4 | 1001333233020031222111 |
5 | 1043301043303430023 |
6 | 13351235422554341 |
7 | 645441354251050 |
oct | 101775710155225 |
9 | 17046131385527 |
10 | 4535202405013 |
11 | 1499406585a75 |
12 | 612b521389b1 |
13 | 26b88b087057 |
14 | 11970d8b9a97 |
15 | 7ce8730085d |
hex | 41fef20da95 |
4535202405013 has 8 divisors (see below), whose sum is σ = 5191302554240. Its totient is φ = 3881155778640.
The previous prime is 4535202404933. The next prime is 4535202405017. The reversal of 4535202405013 is 3105042025354.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4535202405013 - 29 = 4535202404501 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4535202405013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4535202405017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 513375978 + ... + 513384811.
It is an arithmetic number, because the mean of its divisors is an integer number (648912819280).
Almost surely, 24535202405013 is an apocalyptic number.
It is an amenable number.
4535202405013 is a deficient number, since it is larger than the sum of its proper divisors (656100149227).
4535202405013 is a wasteful number, since it uses less digits than its factorization.
4535202405013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026761427.
The product of its (nonzero) digits is 72000, while the sum is 34.
The spelling of 4535202405013 in words is "four trillion, five hundred thirty-five billion, two hundred two million, four hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •