Base | Representation |
---|---|
bin | 1000110010110000111… |
… | …1011100001101001000 |
3 | 112102221001112000220012 |
4 | 2030230033130031020 |
5 | 4433340410204202 |
6 | 153222050451052 |
7 | 13625362445063 |
oct | 2145417341510 |
9 | 472831460805 |
10 | 151066100552 |
11 | 5908096a294 |
12 | 2533b893a88 |
13 | 113263c12a3 |
14 | 74511c78da |
15 | 3de24bb152 |
hex | 232c3dc348 |
151066100552 has 64 divisors (see below), whose sum is σ = 293183193600. Its totient is φ = 72938361600.
The previous prime is 151066100551. The next prime is 151066100561. The reversal of 151066100552 is 255001660151.
151066100552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (151066100551) 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 15 ways as a sum of consecutive naturals, for example, 6967793 + ... + 6989439.
It is an arithmetic number, because the mean of its divisors is an integer number (4580987400).
Almost surely, 2151066100552 is an apocalyptic number.
It is an amenable number.
151066100552 is a deficient number, since it is larger than the sum of its proper divisors (142117093048).
151066100552 is a wasteful number, since it uses less digits than its factorization.
151066100552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21966 (or 21962 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 32.
The spelling of 151066100552 in words is "one hundred fifty-one billion, sixty-six million, one hundred thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •