Base | Representation |
---|---|
bin | 1011110101010110111010… |
… | …1001011101101110011001 |
3 | 1201001212110201121001200201 |
4 | 2331111232221131232121 |
5 | 3201134131422144001 |
6 | 43401151522302201 |
7 | 2512015306524535 |
oct | 275255651355631 |
9 | 51055421531621 |
10 | 13011312303001 |
11 | 4167080655441 |
12 | 156181a1b7961 |
13 | 734c664ca72c |
14 | 32da7258cbc5 |
15 | 1786c2865501 |
hex | bd56ea5db99 |
13011312303001 has 8 divisors (see below), whose sum is σ = 13348886997600. Its totient is φ = 12674700732960.
The previous prime is 13011312302999. The next prime is 13011312303019. The reversal of 13011312303001 is 10030321311031.
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 13011312303001 - 21 = 13011312302999 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 13011312303001.
It is not an unprimeable number, because it can be changed into a prime (13011312303601) 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, 240753771 + ... + 240807808.
It is an arithmetic number, because the mean of its divisors is an integer number (1668610874700).
Almost surely, 213011312303001 is an apocalyptic number.
It is an amenable number.
13011312303001 is a deficient number, since it is larger than the sum of its proper divisors (337574694599).
13011312303001 is an equidigital number, since it uses as much as digits as its factorization.
13011312303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481562279.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13011312303001 its reverse (10030321311031), we get a palindrome (23041633614032).
The spelling of 13011312303001 in words is "thirteen trillion, eleven billion, three hundred twelve million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •