Base | Representation |
---|---|
bin | 1100000110110100001010… |
… | …0011101011110011011111 |
3 | 1202010112120211101220110011 |
4 | 3001231002203223303133 |
5 | 3221042334344113043 |
6 | 44151031251424051 |
7 | 2542463306455651 |
oct | 301550243536337 |
9 | 52115524356404 |
10 | 13311220301023 |
11 | 4272290923247 |
12 | 15ab9788b5027 |
13 | 7573202560a8 |
14 | 3403a33c26d1 |
15 | 1813c6dee59d |
hex | c1b428ebcdf |
13311220301023 has 8 divisors (see below), whose sum is σ = 13772362679280. Its totient is φ = 12850220241600.
The previous prime is 13311220300979. The next prime is 13311220301083. The reversal of 13311220301023 is 32010302211331.
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 13311220301023 - 213 = 13311220292831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13311220300985 and 13311220301003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13311220301083) 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, 35389390 + ... + 35763547.
It is an arithmetic number, because the mean of its divisors is an integer number (1721545334910).
Almost surely, 213311220301023 is an apocalyptic number.
13311220301023 is a deficient number, since it is larger than the sum of its proper divisors (461142378257).
13311220301023 is an equidigital number, since it uses as much as digits as its factorization.
13311220301023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71159417.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13311220301023 its reverse (32010302211331), we get a palindrome (45321522512354).
The spelling of 13311220301023 in words is "thirteen trillion, three hundred eleven billion, two hundred twenty million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •