Base | Representation |
---|---|
bin | 100110110000110… |
… | …0000100101000111 |
3 | 10100122100211201020 |
4 | 1031201200211013 |
5 | 10130430123311 |
6 | 333021002223 |
7 | 44142112464 |
oct | 11541404507 |
9 | 3318324636 |
10 | 1300629831 |
11 | 608198496 |
12 | 3036b3373 |
13 | 1795c8867 |
14 | c4a4666b |
15 | 792b6c06 |
hex | 4d860947 |
1300629831 has 16 divisors (see below), whose sum is σ = 1814645760. Its totient is φ = 827616960.
The previous prime is 1300629821. The next prime is 1300629853. The reversal of 1300629831 is 1389260031.
It is a de Polignac number, because none of the positive numbers 2k-1300629831 is a prime.
It is a super-2 number, since 2×13006298312 = 3383275914574177122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1300629792 and 1300629801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300629821) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 89001 + ... + 102578.
It is an arithmetic number, because the mean of its divisors is an integer number (113415360).
Almost surely, 21300629831 is an apocalyptic number.
1300629831 is a deficient number, since it is larger than the sum of its proper divisors (514015929).
1300629831 is a wasteful number, since it uses less digits than its factorization.
1300629831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191686.
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 1300629831 is about 36064.2458814821. The cubic root of 1300629831 is about 1091.5691092381.
Adding to 1300629831 its reverse (1389260031), we get a palindrome (2689889862).
The spelling of 1300629831 in words is "one billion, three hundred million, six hundred twenty-nine thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •