Base | Representation |
---|---|
bin | 110000001000001000… |
… | …1111111011000111111 |
3 | 100212202210201012202200 |
4 | 1200100101333120333 |
5 | 3143131201213110 |
6 | 115251315522543 |
7 | 10316111423136 |
oct | 1402021773077 |
9 | 325683635680 |
10 | 103352366655 |
11 | 3a91679785a |
12 | 180445b9453 |
13 | 99911c8455 |
14 | 500638c91d |
15 | 2a4d6d36c0 |
hex | 181047f63f |
103352366655 has 48 divisors (see below), whose sum is σ = 188967168000. Its totient is φ = 52110917568.
The previous prime is 103352366629. The next prime is 103352366687. The reversal of 103352366655 is 556663253301.
It is not a de Polignac number, because 103352366655 - 26 = 103352366591 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 103352366655.
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 47 ways as a sum of consecutive naturals, for example, 283366 + ... + 535724.
It is an arithmetic number, because the mean of its divisors is an integer number (3936816000).
Almost surely, 2103352366655 is an apocalyptic number.
103352366655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
103352366655 is a deficient number, since it is larger than the sum of its proper divisors (85614801345).
103352366655 is a wasteful number, since it uses less digits than its factorization.
103352366655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252868 (or 252865 counting only the distinct ones).
The product of its (nonzero) digits is 1458000, while the sum is 45.
The spelling of 103352366655 in words is "one hundred three billion, three hundred fifty-two million, three hundred sixty-six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •