Base | Representation |
---|---|
bin | 100011010000001101001001… |
… | …110101110011101101100001 |
3 | 202022222011220222101210102210 |
4 | 203100031021311303231201 |
5 | 130310230144343314023 |
6 | 1305430451033232333 |
7 | 44441436105655263 |
oct | 4320151165635541 |
9 | 668864828353383 |
10 | 155045263260513 |
11 | 454473660a833a |
12 | 15480988b626a9 |
13 | 6868923247662 |
14 | 2a4033339db33 |
15 | 12dd13a742593 |
hex | 8d0349d73b61 |
155045263260513 has 12 divisors (see below), whose sum is σ = 216105937199600. Its totient is φ = 98869443237576.
The previous prime is 155045263260463. The next prime is 155045263260553. The reversal of 155045263260513 is 315062362540551.
It is not a de Polignac number, because 155045263260513 - 26 = 155045263260449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155045263260553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48848537563 + ... + 48848540736.
Almost surely, 2155045263260513 is an apocalyptic number.
It is an amenable number.
155045263260513 is a deficient number, since it is larger than the sum of its proper divisors (61060673939087).
155045263260513 is an equidigital number, since it uses as much as digits as its factorization.
155045263260513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97697078348 (or 97697078325 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 48.
The spelling of 155045263260513 in words is "one hundred fifty-five trillion, forty-five billion, two hundred sixty-three million, two hundred sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •