Base | Representation |
---|---|
bin | 1001000001111110111… |
… | …0000110000111011001 |
3 | 112211110201222102112021 |
4 | 2100133232012013121 |
5 | 10020222124000100 |
6 | 155135252214441 |
7 | 14131533512020 |
oct | 2203756060731 |
9 | 484421872467 |
10 | 155151000025 |
11 | 5a88777076a |
12 | 2609b90a421 |
13 | 1182779a178 |
14 | 771b91b8b7 |
15 | 4080e11a1a |
hex | 241fb861d9 |
155151000025 has 12 divisors (see below), whose sum is σ = 219871131712. Its totient is φ = 106389257040.
The previous prime is 155151000023. The next prime is 155151000041. The reversal of 155151000025 is 520000151551.
155151000025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 155151000025 - 21 = 155151000023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155151000023) 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 11 ways as a sum of consecutive naturals, for example, 443288397 + ... + 443288746.
Almost surely, 2155151000025 is an apocalyptic number.
It is an amenable number.
155151000025 is a deficient number, since it is larger than the sum of its proper divisors (64720131687).
155151000025 is an equidigital number, since it uses as much as digits as its factorization.
155151000025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886577160 (or 886577155 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 25.
Adding to 155151000025 its reverse (520000151551), we get a palindrome (675151151576).
The spelling of 155151000025 in words is "one hundred fifty-five billion, one hundred fifty-one million, twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •