Base | Representation |
---|---|
bin | 1100001010110100110000… |
… | …1011010010111100101001 |
3 | 1202101010101020212220212010 |
4 | 3002231030023102330221 |
5 | 3223204421344003044 |
6 | 44242422243310133 |
7 | 2550452244206013 |
oct | 302551413227451 |
9 | 52333336786763 |
10 | 13380101156649 |
11 | 4299518314607 |
12 | 16011a097b349 |
13 | 760979878c26 |
14 | 3438595151b3 |
15 | 1830a9146bb9 |
hex | c2b4c2d2f29 |
13380101156649 has 4 divisors (see below), whose sum is σ = 17840134875536. Its totient is φ = 8920067437764.
The previous prime is 13380101156641. The next prime is 13380101156677. The reversal of 13380101156649 is 94665110108331.
It is a happy number.
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 not a de Polignac number, because 13380101156649 - 23 = 13380101156641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13380101156598 and 13380101156607.
It is not an unprimeable number, because it can be changed into a prime (13380101156641) 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, 2230016859439 + ... + 2230016859444.
It is an arithmetic number, because the mean of its divisors is an integer number (4460033718884).
Almost surely, 213380101156649 is an apocalyptic number.
It is an amenable number.
13380101156649 is a deficient number, since it is larger than the sum of its proper divisors (4460033718887).
13380101156649 is an equidigital number, since it uses as much as digits as its factorization.
13380101156649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4460033718886.
The product of its (nonzero) digits is 466560, while the sum is 48.
The spelling of 13380101156649 in words is "thirteen trillion, three hundred eighty billion, one hundred one million, one hundred fifty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •