Base | Representation |
---|---|
bin | 100110110000100… |
… | …0100100100111100 |
3 | 10100122011000101010 |
4 | 1031201010210330 |
5 | 10130412441012 |
6 | 333014315220 |
7 | 44141124210 |
oct | 11541044474 |
9 | 3318130333 |
10 | 1300515132 |
11 | 60811a2a4 |
12 | 303658b10 |
13 | 1795885a7 |
14 | c4a16940 |
15 | 79292c3c |
hex | 4d84493c |
1300515132 has 24 divisors (see below), whose sum is σ = 3468040576. Its totient is φ = 371575728.
The previous prime is 1300515119. The next prime is 1300515157. The reversal of 1300515132 is 2315150031.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1300515099 and 1300515108.
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, 7741078 + ... + 7741245.
Almost surely, 21300515132 is an apocalyptic number.
1300515132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1300515132 is an abundant number, since it is smaller than the sum of its proper divisors (2167525444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300515132 is a wasteful number, since it uses less digits than its factorization.
1300515132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15482337 (or 15482335 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 1300515132 is about 36062.6556426451. The cubic root of 1300515132 is about 1091.5370207932.
Adding to 1300515132 its reverse (2315150031), we get a palindrome (3615665163).
The spelling of 1300515132 in words is "one billion, three hundred million, five hundred fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •