Base | Representation |
---|---|
bin | 1011110101110111110001… |
… | …0011010100001011001101 |
3 | 1201002201020100010011011222 |
4 | 2331131330103110023031 |
5 | 3201310212103443313 |
6 | 43405211000253125 |
7 | 2512446664053155 |
oct | 275357423241315 |
9 | 51081210104158 |
10 | 13020131312333 |
11 | 416a896767702 |
12 | 156347b7711a5 |
13 | 735a4061ac52 |
14 | 33026b92d765 |
15 | 178a3bbe0208 |
hex | bd77c4d42cd |
13020131312333 has 4 divisors (see below), whose sum is σ = 13029438055200. Its totient is φ = 13010824569468.
The previous prime is 13020131312327. The next prime is 13020131312369. The reversal of 13020131312333 is 33321313102031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13020131312333 - 218 = 13020131050189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020131312233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4653369335 + ... + 4653372132.
It is an arithmetic number, because the mean of its divisors is an integer number (3257359513800).
Almost surely, 213020131312333 is an apocalyptic number.
It is an amenable number.
13020131312333 is a deficient number, since it is larger than the sum of its proper divisors (9306742867).
13020131312333 is an equidigital number, since it uses as much as digits as its factorization.
13020131312333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9306742866.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13020131312333 its reverse (33321313102031), we get a palindrome (46341444414364).
The spelling of 13020131312333 in words is "thirteen trillion, twenty billion, one hundred thirty-one million, three hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •