Base | Representation |
---|---|
bin | 1000110010111010101… |
… | …0010111000010101000 |
3 | 112110000212221021221112 |
4 | 2030232222113002220 |
5 | 4433431304233340 |
6 | 153230101125452 |
7 | 13626364600016 |
oct | 2145652270250 |
9 | 473025837845 |
10 | 151106711720 |
11 | 590a1888038 |
12 | 253513b9888 |
13 | 11331940073 |
14 | 74567598b6 |
15 | 3de5d3e065 |
hex | 232ea970a8 |
151106711720 has 16 divisors (see below), whose sum is σ = 339990101460. Its totient is φ = 60442684672.
The previous prime is 151106711699. The next prime is 151106711729. The reversal of 151106711720 is 27117601151.
It can be written as a sum of positive squares in 2 ways, for example, as 150641791876 + 464919844 = 388126^2 + 21562^2 .
It is not an unprimeable number, because it can be changed into a prime (151106711729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1888833857 + ... + 1888833936.
Almost surely, 2151106711720 is an apocalyptic number.
151106711720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
151106711720 is an abundant number, since it is smaller than the sum of its proper divisors (188883389740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151106711720 is a wasteful number, since it uses less digits than its factorization.
151106711720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777667804 (or 3777667800 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 32.
The spelling of 151106711720 in words is "one hundred fifty-one billion, one hundred six million, seven hundred eleven thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •