Base | Representation |
---|---|
bin | 1011110101011001100110… |
… | …0111110110011011101001 |
3 | 1201001221022222021111220201 |
4 | 2331112121213312123221 |
5 | 3201142121011101301 |
6 | 43401351235552201 |
7 | 2512042213100305 |
oct | 275263147663351 |
9 | 51057288244821 |
10 | 13012033300201 |
11 | 41674106362a1 |
12 | 156199b75b661 |
13 | 73504c9ac0b0 |
14 | 32db00230d05 |
15 | 178715cd4201 |
hex | bd5999f66e9 |
13012033300201 has 8 divisors (see below), whose sum is σ = 14020844702984. Its totient is φ = 12004348435200.
The previous prime is 13012033300183. The next prime is 13012033300223. The reversal of 13012033300201 is 10200333021031.
It can be written as a sum of positive squares in 4 ways, for example, as 10852638976 + 13001180661225 = 104176^2 + 3605715^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13012033300201 - 29 = 13012033299689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13012033300261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281610450 + ... + 281656651.
It is an arithmetic number, because the mean of its divisors is an integer number (1752605587873).
Almost surely, 213012033300201 is an apocalyptic number.
It is an amenable number.
13012033300201 is a deficient number, since it is larger than the sum of its proper divisors (1008811402783).
13012033300201 is a wasteful number, since it uses less digits than its factorization.
13012033300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563268891.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13012033300201 its reverse (10200333021031), we get a palindrome (23212366321232).
The spelling of 13012033300201 in words is "thirteen trillion, twelve billion, thirty-three million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •