Base | Representation |
---|---|
bin | 1010010101111001010… |
… | …11001010100111011100 |
3 | 1020222020010220002201120 |
4 | 11022330223022213130 |
5 | 21310230301004211 |
6 | 431125150410540 |
7 | 34446654354006 |
oct | 5127453124734 |
9 | 1228203802646 |
10 | 355352750556 |
11 | 127782400041 |
12 | 58a52b00a50 |
13 | 2768183734b |
14 | 132b0719376 |
15 | 939be38d06 |
hex | 52bcaca9dc |
355352750556 has 12 divisors (see below), whose sum is σ = 829156417992. Its totient is φ = 118450916848.
The previous prime is 355352750551. The next prime is 355352750573. The reversal of 355352750556 is 655057253553.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 355352750499 and 355352750508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (355352750551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14806364595 + ... + 14806364618.
It is an arithmetic number, because the mean of its divisors is an integer number (69096368166).
Almost surely, 2355352750556 is an apocalyptic number.
It is an amenable number.
355352750556 is an abundant number, since it is smaller than the sum of its proper divisors (473803667436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
355352750556 is a wasteful number, since it uses less digits than its factorization.
355352750556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29612729220 (or 29612729218 counting only the distinct ones).
The product of its (nonzero) digits is 11812500, while the sum is 51.
The spelling of 355352750556 in words is "three hundred fifty-five billion, three hundred fifty-two million, seven hundred fifty thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •