Base | Representation |
---|---|
bin | 1001000010101111010… |
… | …0100001111001000101 |
3 | 112211222212222120022201 |
4 | 2100223310201321011 |
5 | 10021131111411003 |
6 | 155211343354501 |
7 | 14136550216225 |
oct | 2205364417105 |
9 | 484885876281 |
10 | 155354013253 |
11 | 5a98132159a |
12 | 261378b2a31 |
13 | 1185a86ab3a |
14 | 773a886085 |
15 | 4093b63b1d |
hex | 242bd21e45 |
155354013253 has 4 divisors (see below), whose sum is σ = 155365566048. Its totient is φ = 155342460460.
The previous prime is 155354013223. The next prime is 155354013299. The reversal of 155354013253 is 352310453551.
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, and also an emirpimes, since its reverse is a distinct semiprime: 352310453551 = 7 ⋅50330064793.
It is a cyclic number.
It is not a de Polignac number, because 155354013253 - 29 = 155354012741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155354013223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5756203 + ... + 5783128.
It is an arithmetic number, because the mean of its divisors is an integer number (38841391512).
Almost surely, 2155354013253 is an apocalyptic number.
It is an amenable number.
155354013253 is a deficient number, since it is larger than the sum of its proper divisors (11552795).
155354013253 is a wasteful number, since it uses less digits than its factorization.
155354013253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11552794.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 155354013253 in words is "one hundred fifty-five billion, three hundred fifty-four million, thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •