Base | Representation |
---|---|
bin | 1111011111110… |
… | …10011111100001 |
3 | 100001121201122212 |
4 | 13233322133201 |
5 | 231240011430 |
6 | 20522211505 |
7 | 3135663161 |
oct | 757723741 |
9 | 301551585 |
10 | 130000865 |
11 | 67422635 |
12 | 37653b95 |
13 | 20c18cb7 |
14 | 133a05a1 |
15 | b62db95 |
hex | 7bfa7e1 |
130000865 has 4 divisors (see below), whose sum is σ = 156001044. Its totient is φ = 104000688.
The previous prime is 130000847. The next prime is 130000909. The reversal of 130000865 is 568000031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83923921 + 46076944 = 9161^2 + 6788^2 .
It is a cyclic number.
It is not a de Polignac number, because 130000865 - 222 = 125806561 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130000865.
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 3 ways as a sum of consecutive naturals, for example, 13000082 + ... + 13000091.
It is an arithmetic number, because the mean of its divisors is an integer number (39000261).
Almost surely, 2130000865 is an apocalyptic number.
It is an amenable number.
130000865 is a deficient number, since it is larger than the sum of its proper divisors (26000179).
130000865 is an equidigital number, since it uses as much as digits as its factorization.
130000865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26000178.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 130000865 is about 11401.7921836876. The cubic root of 130000865 is about 506.5808254754.
Adding to 130000865 its reverse (568000031), we get a palindrome (698000896).
The spelling of 130000865 in words is "one hundred thirty million, eight hundred sixty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •