Base | Representation |
---|---|
bin | 11000001101101111… |
… | …11000011000110001 |
3 | 1020120000012022002211 |
4 | 30012313320120301 |
5 | 203111023322230 |
6 | 5545555412121 |
7 | 640104665506 |
oct | 140667703061 |
9 | 36500168084 |
10 | 13000214065 |
11 | 5571311273 |
12 | 26298b4041 |
13 | 12c2448277 |
14 | 8b47c34ad |
15 | 51149542a |
hex | 306df8631 |
13000214065 has 4 divisors (see below), whose sum is σ = 15600256884. Its totient is φ = 10400171248.
The previous prime is 13000214057. The next prime is 13000214107. The reversal of 13000214065 is 56041200031.
13000214065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 9257711089 + 3742502976 = 96217^2 + 61176^2 .
It is a cyclic number.
It is not a de Polignac number, because 13000214065 - 23 = 13000214057 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1300021402 + ... + 1300021411.
It is an arithmetic number, because the mean of its divisors is an integer number (3900064221).
Almost surely, 213000214065 is an apocalyptic number.
It is an amenable number.
13000214065 is a deficient number, since it is larger than the sum of its proper divisors (2600042819).
13000214065 is an equidigital number, since it uses as much as digits as its factorization.
13000214065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2600042818.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 13000214065 its reverse (56041200031), we get a palindrome (69041414096).
The spelling of 13000214065 in words is "thirteen billion, two hundred fourteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •