Base | Representation |
---|---|
bin | 1101110010001011000001… |
… | …1011010001100010110101 |
3 | 1222122212021010210001011101 |
4 | 3130202300123101202311 |
5 | 3441302134231410203 |
6 | 52122215535210101 |
7 | 3122646003136066 |
oct | 334426033214265 |
9 | 58585233701141 |
10 | 15155604560053 |
11 | 4913501739641 |
12 | 1849311376931 |
13 | 85c223961b59 |
14 | 3a576c73a56d |
15 | 1b43732b941d |
hex | dc8b06d18b5 |
15155604560053 has 4 divisors (see below), whose sum is σ = 15271296198048. Its totient is φ = 15039912922060.
The previous prime is 15155604560017. The next prime is 15155604560137. The reversal of 15155604560053 is 35006540655151.
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 15155604560053 - 213 = 15155604551861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15155604559985 and 15155604560012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15155604560003) 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, 57845818801 + ... + 57845819062.
It is an arithmetic number, because the mean of its divisors is an integer number (3817824049512).
Almost surely, 215155604560053 is an apocalyptic number.
It is an amenable number.
15155604560053 is a deficient number, since it is larger than the sum of its proper divisors (115691637995).
15155604560053 is a wasteful number, since it uses less digits than its factorization.
15155604560053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115691637994.
The product of its (nonzero) digits is 1350000, while the sum is 46.
The spelling of 15155604560053 in words is "fifteen trillion, one hundred fifty-five billion, six hundred four million, five hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •