Base | Representation |
---|---|
bin | 1011111101101110111100… |
… | …1010000010001110101111 |
3 | 1201120121212122220111110012 |
4 | 2333123233022002032233 |
5 | 3211013323233324201 |
6 | 43551225543203435 |
7 | 2525301114046322 |
oct | 277335712021657 |
9 | 51517778814405 |
10 | 13155202245551 |
11 | 42120a9791a33 |
12 | 158569674657b |
13 | 7456b7c58882 |
14 | 336a026827b9 |
15 | 17c2e4d1c5bb |
hex | bf6ef2823af |
13155202245551 has 4 divisors (see below), whose sum is σ = 13313698658232. Its totient is φ = 12996705832872.
The previous prime is 13155202245541. The next prime is 13155202245571. The reversal of 13155202245551 is 15554220255131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13155202245551 - 226 = 13155135136687 is a prime.
It is a super-2 number, since 2×131552022455512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13155202245499 and 13155202245508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13155202245511) 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, 79248206216 + ... + 79248206381.
It is an arithmetic number, because the mean of its divisors is an integer number (3328424664558).
Almost surely, 213155202245551 is an apocalyptic number.
13155202245551 is a deficient number, since it is larger than the sum of its proper divisors (158496412681).
13155202245551 is an equidigital number, since it uses as much as digits as its factorization.
13155202245551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158496412680.
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 13155202245551 in words is "thirteen trillion, one hundred fifty-five billion, two hundred two million, two hundred forty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •