Base | Representation |
---|---|
bin | 10111000110100010010000… |
… | …000001101001111001001100 |
3 | 111022202021002210110102210001 |
4 | 113012202100001221321030 |
5 | 101304140311123111040 |
6 | 1000032150304454044 |
7 | 30254441604155341 |
oct | 2706422001517114 |
9 | 438667083412701 |
10 | 101604162707020 |
11 | 2a4130a103aaa6 |
12 | b48b69861a324 |
13 | 44903015bb31c |
14 | 1b1394c2c87c8 |
15 | bb2e5656859a |
hex | 5c6890069e4c |
101604162707020 has 24 divisors (see below), whose sum is σ = 214156080226368. Its totient is φ = 40491695836800.
The previous prime is 101604162707011. The next prime is 101604162707027. The reversal of 101604162707020 is 20707261406101.
It is not an unprimeable number, because it can be changed into a prime (101604162707027) 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 7 ways as a sum of consecutive naturals, for example, 9373072321 + ... + 9373083160.
It is an arithmetic number, because the mean of its divisors is an integer number (8923170009432).
Almost surely, 2101604162707020 is an apocalyptic number.
101604162707020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101604162707020 is an abundant number, since it is smaller than the sum of its proper divisors (112551917519348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101604162707020 is a wasteful number, since it uses less digits than its factorization.
101604162707020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18746155761 (or 18746155759 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 101604162707020 in words is "one hundred one trillion, six hundred four billion, one hundred sixty-two million, seven hundred seven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •