Base | Representation |
---|---|
bin | 1001000001011110001… |
… | …0011011011010100011 |
3 | 112211010011200001222001 |
4 | 2100113202123122203 |
5 | 10014432003130221 |
6 | 155113510024431 |
7 | 14125245624562 |
oct | 2202742333243 |
9 | 484104601861 |
10 | 155013723811 |
11 | 5a81722a051 |
12 | 26061948117 |
13 | 1180520483b |
14 | 77075c5bd9 |
15 | 4073d47391 |
hex | 241789b6a3 |
155013723811 has 4 divisors (see below), whose sum is σ = 159203283952. Its totient is φ = 150824163672.
The previous prime is 155013723791. The next prime is 155013723827. The reversal of 155013723811 is 118327310551.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 118327310551 = 211 ⋅560792941.
It is a cyclic number.
It is not a de Polignac number, because 155013723811 - 211 = 155013721763 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 4189560103 = 155013723811 / (1 + 5 + 5 + 0 + 1 + 3 + 7 + 2 + 3 + 8 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155013723871) 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, 2094780015 + ... + 2094780088.
It is an arithmetic number, because the mean of its divisors is an integer number (39800820988).
Almost surely, 2155013723811 is an apocalyptic number.
155013723811 is a deficient number, since it is larger than the sum of its proper divisors (4189560141).
155013723811 is an equidigital number, since it uses as much as digits as its factorization.
155013723811 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4189560140.
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 155013723811 in words is "one hundred fifty-five billion, thirteen million, seven hundred twenty-three thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •