Base | Representation |
---|---|
bin | 1001000011011010010… |
… | …0110010010011011111 |
3 | 112212110110110222012001 |
4 | 2100312210302103133 |
5 | 10022013303414201 |
6 | 155241310423131 |
7 | 14144200613605 |
oct | 2206644622337 |
9 | 485413428161 |
10 | 155534435551 |
11 | 5aa64152530 |
12 | 26188201aa7 |
13 | 1188905bcb1 |
14 | 775680d875 |
15 | 40a4902301 |
hex | 24369324df |
155534435551 has 16 divisors (see below), whose sum is σ = 169946668800. Its totient is φ = 141167836800.
The previous prime is 155534435509. The next prime is 155534435557.
155534435551 is nontrivially palindromic in base 10.
155534435551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 155534435551 - 213 = 155534427359 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 (155534435557) 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 15 ways as a sum of consecutive naturals, for example, 32942871 + ... + 32947591.
It is an arithmetic number, because the mean of its divisors is an integer number (10621666800).
Almost surely, 2155534435551 is an apocalyptic number.
155534435551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
155534435551 is a deficient number, since it is larger than the sum of its proper divisors (14412233249).
155534435551 is a wasteful number, since it uses less digits than its factorization.
155534435551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8910.
The product of its digits is 2250000, while the sum is 46.
The spelling of 155534435551 in words is "one hundred fifty-five billion, five hundred thirty-four million, four hundred thirty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •