Base | Representation |
---|---|
bin | 1100001001101101111100… |
… | …0001001000011110000111 |
3 | 1202022022022022212100111201 |
4 | 3002123133001020132013 |
5 | 3222402003004002232 |
6 | 44225555554243331 |
7 | 2546210156225644 |
oct | 302333701103607 |
9 | 52268268770451 |
10 | 13361089906567 |
11 | 4291451a24a87 |
12 | 15b9575b86547 |
13 | 75bc39c9c920 |
14 | 34297468cdcb |
15 | 1828450d8be7 |
hex | c26df048787 |
13361089906567 has 8 divisors (see below), whose sum is σ = 14389855250400. Its totient is φ = 12332465876640.
The previous prime is 13361089906519. The next prime is 13361089906573. The reversal of 13361089906567 is 76560998016331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13361089906567 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13361089906499 and 13361089906508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13361089900567) 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, 35132059 + ... + 35510332.
It is an arithmetic number, because the mean of its divisors is an integer number (1798731906300).
Almost surely, 213361089906567 is an apocalyptic number.
13361089906567 is a deficient number, since it is larger than the sum of its proper divisors (1028765343833).
13361089906567 is a wasteful number, since it uses less digits than its factorization.
13361089906567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70656953.
The product of its (nonzero) digits is 44089920, while the sum is 64.
The spelling of 13361089906567 in words is "thirteen trillion, three hundred sixty-one billion, eighty-nine million, nine hundred six thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •