Base | Representation |
---|---|
bin | 101111000100000000… |
… | …0110101000100011000 |
3 | 100122212110211012210210 |
4 | 1132020000311010120 |
5 | 3123440414312202 |
6 | 114232410411120 |
7 | 10205341145541 |
oct | 1361000650430 |
9 | 318773735723 |
10 | 101066166552 |
11 | 3995324188a |
12 | 17706a30aa0 |
13 | 96b8675620 |
14 | 4c6a8b34c8 |
15 | 2967b3ac6c |
hex | 1788035118 |
101066166552 has 32 divisors (see below), whose sum is σ = 272101218480. Its totient is φ = 31097281920.
The previous prime is 101066166541. The next prime is 101066166569. The reversal of 101066166552 is 255661660101.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 101066166552.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161964699 + ... + 161965322.
Almost surely, 2101066166552 is an apocalyptic number.
101066166552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101066166552 is an abundant number, since it is smaller than the sum of its proper divisors (171035051928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101066166552 is a wasteful number, since it uses less digits than its factorization.
101066166552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323930043 (or 323930039 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 101066166552 in words is "one hundred one billion, sixty-six million, one hundred sixty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •