Base | Representation |
---|---|
bin | 1001000001011111101… |
… | …0111101001000000111 |
3 | 112211010121202201122011 |
4 | 2100113322331020013 |
5 | 10014440124401401 |
6 | 155114255515051 |
7 | 14125354363600 |
oct | 2202772751007 |
9 | 484117681564 |
10 | 155020153351 |
11 | 5a81a920718 |
12 | 26063b28a87 |
13 | 118066461bb |
14 | 77083bada7 |
15 | 40746b7451 |
hex | 2417ebd207 |
155020153351 has 6 divisors (see below), whose sum is σ = 180329566200. Its totient is φ = 132874417116.
The previous prime is 155020153349. The next prime is 155020153361. The reversal of 155020153351 is 153351020551.
155020153351 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 155020153351 - 21 = 155020153349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155020153361) 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 5 ways as a sum of consecutive naturals, for example, 1581838251 + ... + 1581838348.
It is an arithmetic number, because the mean of its divisors is an integer number (30054927700).
Almost surely, 2155020153351 is an apocalyptic number.
155020153351 is a deficient number, since it is larger than the sum of its proper divisors (25309412849).
155020153351 is an equidigital number, since it uses as much as digits as its factorization.
155020153351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3163676613 (or 3163676606 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 155020153351 in words is "one hundred fifty-five billion, twenty million, one hundred fifty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •