Base | Representation |
---|---|
bin | 11100111101101101… |
… | …00010110010100101 |
3 | 1111010201001212020210 |
4 | 32132312202302211 |
5 | 223321300002133 |
6 | 11051002250033 |
7 | 1060225551552 |
oct | 163666426245 |
9 | 44121055223 |
10 | 15550000293 |
11 | 665a62a413 |
12 | 301b7b6919 |
13 | 160a789709 |
14 | a772b3a29 |
15 | 610257763 |
hex | 39eda2ca5 |
15550000293 has 8 divisors (see below), whose sum is σ = 21084746400. Its totient is φ = 10190960528.
The previous prime is 15550000267. The next prime is 15550000321. The reversal of 15550000293 is 39200005551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15550000293 - 226 = 15482891429 is a prime.
It is a super-2 number, since 2×155500002932 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15550000293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15550000223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43926378 + ... + 43926731.
It is an arithmetic number, because the mean of its divisors is an integer number (2635593300).
Almost surely, 215550000293 is an apocalyptic number.
It is an amenable number.
15550000293 is a deficient number, since it is larger than the sum of its proper divisors (5534746107).
15550000293 is an equidigital number, since it uses as much as digits as its factorization.
15550000293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87853171.
The product of its (nonzero) digits is 6750, while the sum is 30.
The spelling of 15550000293 in words is "fifteen billion, five hundred fifty million, two hundred ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •