Base | Representation |
---|---|
bin | 101111000110100001… |
… | …1001001100110111100 |
3 | 100200002100210222110201 |
4 | 1132031003021212330 |
5 | 3124124032123202 |
6 | 114245025413244 |
7 | 10210415301310 |
oct | 1361503114674 |
9 | 320070728421 |
10 | 101150661052 |
11 | 39996a02851 |
12 | 1772b19a224 |
13 | 970001a67c |
14 | 4c77bc9b40 |
15 | 297027b387 |
hex | 178d0c99bc |
101150661052 has 12 divisors (see below), whose sum is σ = 202301322160. Its totient is φ = 43350283296.
The previous prime is 101150661047. The next prime is 101150661061. The reversal of 101150661052 is 250166051101.
It is a happy number.
101150661052 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 3612523609 = 101150661052 / (1 + 0 + 1 + 1 + 5 + 0 + 6 + 6 + 1 + 0 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 101150661052.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1806261777 + ... + 1806261832.
Almost surely, 2101150661052 is an apocalyptic number.
It is an amenable number.
101150661052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101150661052 is a wasteful number, since it uses less digits than its factorization.
101150661052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3612523620 (or 3612523618 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 101150661052 in words is "one hundred one billion, one hundred fifty million, six hundred sixty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •