Base | Representation |
---|---|
bin | 10111000101010011111110… |
… | …010100000000010110001100 |
3 | 111022110020011021100201220101 |
4 | 113011103332110000112030 |
5 | 101301301143044243140 |
6 | 555525410230100444 |
7 | 30245405025123622 |
oct | 2705237624002614 |
9 | 438406137321811 |
10 | 101520113665420 |
11 | 2a3904905a404a |
12 | b4773407aa724 |
13 | 44853c8653a08 |
14 | 1b0d8578b1512 |
15 | bb0b8788899a |
hex | 5c54fe50058c |
101520113665420 has 48 divisors (see below), whose sum is σ = 218188757445120. Its totient is φ = 39656661460416.
The previous prime is 101520113665417. The next prime is 101520113665457. The reversal of 101520113665420 is 24566311025101.
It is a self number, because there is not a number n which added to its sum of digits gives 101520113665420.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5563252 + ... + 15296731.
It is an arithmetic number, because the mean of its divisors is an integer number (4545599113440).
Almost surely, 2101520113665420 is an apocalyptic number.
101520113665420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101520113665420 is an abundant number, since it is smaller than the sum of its proper divisors (116668643779700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101520113665420 is a wasteful number, since it uses less digits than its factorization.
101520113665420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20865694 (or 20865692 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 101520113665420 in words is "one hundred one trillion, five hundred twenty billion, one hundred thirteen million, six hundred sixty-five thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •