Base | Representation |
---|---|
bin | 10010011110100… |
… | …01111011000001 |
3 | 101210122211201202 |
4 | 21033101323001 |
5 | 304140004023 |
6 | 23214110545 |
7 | 3561324353 |
oct | 1117217301 |
9 | 353584652 |
10 | 155000513 |
11 | 7a5481a8 |
12 | 43aab455 |
13 | 2615cca5 |
14 | 1682b0d3 |
15 | d91b128 |
hex | 93d1ec1 |
155000513 has 4 divisors (see below), whose sum is σ = 155122608. Its totient is φ = 154878420.
The previous prime is 155000491. The next prime is 155000533. The reversal of 155000513 is 315000551.
It is a happy number.
155000513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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: 315000551 = 7487 ⋅42073.
It is a cyclic number.
It is not a de Polignac number, because 155000513 - 222 = 150806209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155000533) 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, 59123 + ... + 61688.
It is an arithmetic number, because the mean of its divisors is an integer number (38780652).
Almost surely, 2155000513 is an apocalyptic number.
It is an amenable number.
155000513 is a deficient number, since it is larger than the sum of its proper divisors (122095).
155000513 is a wasteful number, since it uses less digits than its factorization.
155000513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122094.
The product of its (nonzero) digits is 375, while the sum is 20.
The square root of 155000513 is about 12449.9202005475. The cubic root of 155000513 is about 537.1691281120.
The spelling of 155000513 in words is "one hundred fifty-five million, five hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •