Base | Representation |
---|---|
bin | 1000110101010101001… |
… | …1100001100101100111 |
3 | 112111201001212122002002 |
4 | 2031111103201211213 |
5 | 4441243242141111 |
6 | 153414301035515 |
7 | 13651426350203 |
oct | 2152523414547 |
9 | 474631778062 |
10 | 151755037031 |
11 | 593a4842484 |
12 | 254b2555b9b |
13 | 11406058a00 |
14 | 74b88c1b03 |
15 | 3e32c0563b |
hex | 23554e1967 |
151755037031 has 12 divisors (see below), whose sum is σ = 164390649480. Its totient is φ = 140026854240.
The previous prime is 151755037013. The next prime is 151755037033. The reversal of 151755037031 is 130730557151.
151755037031 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 151755037031 - 26 = 151755036967 is a prime.
It is a super-2 number, since 2×1517550370312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151755037033) 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, 261761 + ... + 609941.
It is an arithmetic number, because the mean of its divisors is an integer number (13699220790).
Almost surely, 2151755037031 is an apocalyptic number.
151755037031 is a deficient number, since it is larger than the sum of its proper divisors (12635612449).
151755037031 is a wasteful number, since it uses less digits than its factorization.
151755037031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350786 (or 350773 counting only the distinct ones).
The product of its (nonzero) digits is 55125, while the sum is 38.
The spelling of 151755037031 in words is "one hundred fifty-one billion, seven hundred fifty-five million, thirty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •