Base | Representation |
---|---|
bin | 10111000111010010001110… |
… | …100001001000110010010000 |
3 | 111022221012001220201022212121 |
4 | 113013102032201020302100 |
5 | 101311011311303410021 |
6 | 1000111550123104024 |
7 | 30261244304431621 |
oct | 2707221641106220 |
9 | 438835056638777 |
10 | 101655677013136 |
11 | 2a432a26574704 |
12 | b499674672014 |
13 | 4495120cbbb6c |
14 | 1b16237ba3a48 |
15 | bb446dd31741 |
hex | 5c748e848c90 |
101655677013136 has 15 divisors (see below), whose sum is σ = 196957952351923. Its totient is φ = 50827818341680.
The previous prime is 101655677013133. The next prime is 101655677013157. The reversal of 101655677013136 is 631310776556101.
The square root of 101655677013136 is 10082444.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101655677013133) 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 2 ways as a sum of consecutive naturals, for example, 39069471 + ... + 41590081.
Almost surely, 2101655677013136 is an apocalyptic number.
101655677013136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
101655677013136 is the 10082444-th square number.
It is an amenable number.
101655677013136 is a deficient number, since it is larger than the sum of its proper divisors (95302275338787).
101655677013136 is an frugal number, since it uses more digits than its factorization.
101655677013136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5041230 (or 2520613 counting only the distinct ones).
The product of its (nonzero) digits is 2381400, while the sum is 52.
The spelling of 101655677013136 in words is "one hundred one trillion, six hundred fifty-five billion, six hundred seventy-seven million, thirteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •