Base | Representation |
---|---|
bin | 100110111010010… |
… | …1000011000101000 |
3 | 10100222210111211222 |
4 | 1031310220120220 |
5 | 10133221030121 |
6 | 333320241212 |
7 | 44232531002 |
oct | 11564503050 |
9 | 3328714758 |
10 | 1305642536 |
11 | 610001620 |
12 | 305310208 |
13 | 17a662363 |
14 | c558d372 |
15 | 799570ab |
hex | 4dd28628 |
1305642536 has 32 divisors (see below), whose sum is σ = 2714424480. Its totient is φ = 583742400.
The previous prime is 1305642521. The next prime is 1305642557. The reversal of 1305642536 is 6352465031.
It is a super-2 number, since 2×13056425362 = 3409404863625022592, which contains 22 as substring.
It is a Smith number, since the sum of its digits (35) 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 = 1305642496 and 1305642505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116246 + ... + 126981.
It is an arithmetic number, because the mean of its divisors is an integer number (84825765).
Almost surely, 21305642536 is an apocalyptic number.
It is an amenable number.
1305642536 is an abundant number, since it is smaller than the sum of its proper divisors (1408781944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1305642536 is a wasteful number, since it uses less digits than its factorization.
1305642536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243305 (or 243301 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
The square root of 1305642536 is about 36133.6759270352. The cubic root of 1305642536 is about 1092.9696357052.
The spelling of 1305642536 in words is "one billion, three hundred five million, six hundred forty-two thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •