Base | Representation |
---|---|
bin | 1100000110001011110111… |
… | …0011000010010101010101 |
3 | 1202002111122221210011002112 |
4 | 3001202331303002111111 |
5 | 3220403211133134031 |
6 | 44142042031520405 |
7 | 2541631246220555 |
oct | 301427563022525 |
9 | 52074587704075 |
10 | 13300403021141 |
11 | 426873a845815 |
12 | 15a985a089105 |
13 | 7562b8145772 |
14 | 33da588b7165 |
15 | 180e9240462b |
hex | c18bdcc2555 |
13300403021141 has 4 divisors (see below), whose sum is σ = 14000424232800. Its totient is φ = 12600381809484.
The previous prime is 13300403021093. The next prime is 13300403021201. The reversal of 13300403021141 is 14112030400331.
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 13300403021141 - 230 = 13299329279317 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 (13300403021341) 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, 350010605801 + ... + 350010605838.
It is an arithmetic number, because the mean of its divisors is an integer number (3500106058200).
Almost surely, 213300403021141 is an apocalyptic number.
It is an amenable number.
13300403021141 is a deficient number, since it is larger than the sum of its proper divisors (700021211659).
13300403021141 is an equidigital number, since it uses as much as digits as its factorization.
13300403021141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700021211658.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13300403021141 its reverse (14112030400331), we get a palindrome (27412433421472).
The spelling of 13300403021141 in words is "thirteen trillion, three hundred billion, four hundred three million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •