Base | Representation |
---|---|
bin | 1100001100000111011110… |
… | …1001011111111110111111 |
3 | 1202110020200200221212001221 |
4 | 3003001313221133332333 |
5 | 3224040410131044020 |
6 | 44300533432014211 |
7 | 2552166422446420 |
oct | 303016751377677 |
9 | 52406620855057 |
10 | 13402305331135 |
11 | 42a7981a64536 |
12 | 1605558b31367 |
13 | 762aa7ab7306 |
14 | 344964443647 |
15 | 1839586566aa |
hex | c3077a5ffbf |
13402305331135 has 8 divisors (see below), whose sum is σ = 18380304454176. Its totient is φ = 9190152227040.
The previous prime is 13402305331111. The next prime is 13402305331201. The reversal of 13402305331135 is 53113350320431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13402305331135 - 213 = 13402305322943 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13402305331135.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 191461504696 + ... + 191461504765.
It is an arithmetic number, because the mean of its divisors is an integer number (2297538056772).
Almost surely, 213402305331135 is an apocalyptic number.
13402305331135 is a deficient number, since it is larger than the sum of its proper divisors (4977999123041).
13402305331135 is an equidigital number, since it uses as much as digits as its factorization.
13402305331135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382923009473.
The product of its (nonzero) digits is 48600, while the sum is 34.
Adding to 13402305331135 its reverse (53113350320431), we get a palindrome (66515655651566).
The spelling of 13402305331135 in words is "thirteen trillion, four hundred two billion, three hundred five million, three hundred thirty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •