Base | Representation |
---|---|
bin | 11000001111001001… |
… | …11101001101011101 |
3 | 1020120211102121221012 |
4 | 30013210331031131 |
5 | 203122034432201 |
6 | 5551100545005 |
7 | 640310301254 |
oct | 140744751535 |
9 | 36524377835 |
10 | 13012030301 |
11 | 5577a51a56 |
12 | 2631852165 |
13 | 12c4a2471a |
14 | 8b61bb79b |
15 | 51252b5bb |
hex | 30793d35d |
13012030301 has 4 divisors (see below), whose sum is σ = 13012268892. Its totient is φ = 13011791712.
The previous prime is 13012030259. The next prime is 13012030309. The reversal of 13012030301 is 10303021031.
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 7285476025 + 5726554276 = 85355^2 + 75674^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13012030301 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012030309) by changing a digit.
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, 7271 + ... + 161483.
It is an arithmetic number, because the mean of its divisors is an integer number (3253067223).
Almost surely, 213012030301 is an apocalyptic number.
It is an amenable number.
13012030301 is a deficient number, since it is larger than the sum of its proper divisors (238591).
13012030301 is an equidigital number, since it uses as much as digits as its factorization.
13012030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238590.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 13012030301 its reverse (10303021031), we get a palindrome (23315051332).
The spelling of 13012030301 in words is "thirteen billion, twelve million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •