Base | Representation |
---|---|
bin | 100111101001000… |
… | …0111000011010000 |
3 | 10102200220111101120 |
4 | 1033102013003100 |
5 | 10211004210121 |
6 | 335553402240 |
7 | 44651032104 |
oct | 11722070320 |
9 | 3380814346 |
10 | 1330147536 |
11 | 622919593 |
12 | 311569380 |
13 | 182762163 |
14 | c892b904 |
15 | 7bb97bc6 |
hex | 4f4870d0 |
1330147536 has 40 divisors (see below), whose sum is σ = 3437592480. Its totient is φ = 443204736.
The previous prime is 1330147529. The next prime is 1330147561. The reversal of 1330147536 is 6357410331.
It is a junction number, because it is equal to n+sod(n) for n = 1330147497 and 1330147506.
It is a congruent number.
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, 177726 + ... + 185058.
It is an arithmetic number, because the mean of its divisors is an integer number (85939812).
Almost surely, 21330147536 is an apocalyptic number.
1330147536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1330147536 is an abundant number, since it is smaller than the sum of its proper divisors (2107444944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330147536 is a wasteful number, since it uses less digits than its factorization.
1330147536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11123 (or 11117 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 33.
The square root of 1330147536 is about 36471.1877514292. The cubic root of 1330147536 is about 1099.7651112791.
Adding to 1330147536 its reverse (6357410331), we get a palindrome (7687557867).
The spelling of 1330147536 in words is "one billion, three hundred thirty million, one hundred forty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •