Base | Representation |
---|---|
bin | 1001000011110100011… |
… | …0110101101100010101 |
3 | 112212202002200201111112 |
4 | 2100331012311230111 |
5 | 10022224332304441 |
6 | 155300223344405 |
7 | 14150001250310 |
oct | 2207506655425 |
9 | 485662621445 |
10 | 155644025621 |
11 | 6000aaa4137 |
12 | 261b8a52105 |
13 | 118a597c8a6 |
14 | 77671b9977 |
15 | 40ae34d4eb |
hex | 243d1b5b15 |
155644025621 has 8 divisors (see below), whose sum is σ = 178027998144. Its totient is φ = 133297331040.
The previous prime is 155644025569. The next prime is 155644025633. The reversal of 155644025621 is 126520446551.
155644025621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 155644025621 - 214 = 155644009237 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 (155644025221) 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, 9310535 + ... + 9327236.
It is an arithmetic number, because the mean of its divisors is an integer number (22253499768).
Almost surely, 2155644025621 is an apocalyptic number.
It is an amenable number.
155644025621 is a deficient number, since it is larger than the sum of its proper divisors (22383972523).
155644025621 is a wasteful number, since it uses less digits than its factorization.
155644025621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18638971.
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 155644025621 in words is "one hundred fifty-five billion, six hundred forty-four million, twenty-five thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •