Base | Representation |
---|---|
bin | 1100000111111010001100… |
… | …1110011110010110000001 |
3 | 1202012100010011010011201120 |
4 | 3001332203032132112001 |
5 | 3221344341113000001 |
6 | 44203421053222453 |
7 | 2544030241331610 |
oct | 301764316362601 |
9 | 52170104104646 |
10 | 13330022000001 |
11 | 427a2599a6a43 |
12 | 15b3545491a29 |
13 | 7590285b2965 |
14 | 34126849b877 |
15 | 181b27868236 |
hex | c1fa339e581 |
13330022000001 has 8 divisors (see below), whose sum is σ = 20312414476224. Its totient is φ = 7617155428560.
The previous prime is 13330021999993. The next prime is 13330022000003. The reversal of 13330022000001 is 10000022003331.
13330022000001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13330022000001 - 23 = 13330021999993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13330022000003) 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, 317381476170 + ... + 317381476211.
It is an arithmetic number, because the mean of its divisors is an integer number (2539051809528).
Almost surely, 213330022000001 is an apocalyptic number.
It is an amenable number.
13330022000001 is a deficient number, since it is larger than the sum of its proper divisors (6982392476223).
13330022000001 is an equidigital number, since it uses as much as digits as its factorization.
13330022000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 634762952391.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 13330022000001 its reverse (10000022003331), we get a palindrome (23330044003332).
The spelling of 13330022000001 in words is "thirteen trillion, three hundred thirty billion, twenty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •