Base | Representation |
---|---|
bin | 11011101111110011011100… |
… | …10101110011000110111100 |
3 | 22000001002100212100000210010 |
4 | 31313321232111303012330 |
5 | 30444142042043140400 |
6 | 333434234013143220 |
7 | 15565162145565531 |
oct | 1567715625630674 |
9 | 260032325300703 |
10 | 61016156615100 |
11 | 184948967a3065 |
12 | 6a1540b48ab10 |
13 | 2807a501a70bb |
14 | 110d2aa83cd88 |
15 | 70c284949450 |
hex | 377e6e5731bc |
61016156615100 has 72 divisors (see below), whose sum is σ = 176541202080880. Its totient is φ = 16270871662080.
The previous prime is 61016156615053. The next prime is 61016156615111. The reversal of 61016156615100 is 151665161016.
It is a super-2 number, since 2×610161566151002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54431874 + ... + 55541526.
Almost surely, 261016156615100 is an apocalyptic number.
61016156615100 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
61016156615100 is an abundant number, since it is smaller than the sum of its proper divisors (115525045465780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61016156615100 is a wasteful number, since it uses less digits than its factorization.
61016156615100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292959 (or 1292952 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 39.
The spelling of 61016156615100 in words is "sixty-one trillion, sixteen billion, one hundred fifty-six million, six hundred fifteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •