Base | Representation |
---|---|
bin | 110011100110000011011… |
… | …000000010010011101101 |
3 | 110112221200121212020010202 |
4 | 303212003120002103231 |
5 | 431042242321313110 |
6 | 11312445411043245 |
7 | 514105041616100 |
oct | 63460330022355 |
9 | 13487617766122 |
10 | 3545552135405 |
11 | 1147729825775 |
12 | 49319a2a0525 |
13 | 1c9462099247 |
14 | c3869c32737 |
15 | 623644cb0a5 |
hex | 339836024ed |
3545552135405 has 24 divisors (see below), whose sum is σ = 4949394451200. Its totient is φ = 2431190015520.
The previous prime is 3545552135357. The next prime is 3545552135449. The reversal of 3545552135405 is 5045312555453.
It is not a de Polignac number, because 3545552135405 - 210 = 3545552134381 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3545552135405.
It is a congruent number.
It is an unprimeable number.
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, 17645696 + ... + 17845494.
It is an arithmetic number, because the mean of its divisors is an integer number (206224768800).
Almost surely, 23545552135405 is an apocalyptic number.
3545552135405 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3545552135405 is a deficient number, since it is larger than the sum of its proper divisors (1403842315795).
3545552135405 is a wasteful number, since it uses less digits than its factorization.
3545552135405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272249 (or 272242 counting only the distinct ones).
The product of its (nonzero) digits is 4500000, while the sum is 47.
The spelling of 3545552135405 in words is "three trillion, five hundred forty-five billion, five hundred fifty-two million, one hundred thirty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •