Base | Representation |
---|---|
bin | 11000010110111000000011… |
… | …010100100011100001100000 |
3 | 112001022001200111110222100000 |
4 | 120112320003110203201200 |
5 | 103020114231241014424 |
6 | 1015500334430500000 |
7 | 31364351405043321 |
oct | 3026700324434140 |
9 | 461261614428300 |
10 | 107125130016864 |
11 | 3115157016a1a3 |
12 | 10021699364600 |
13 | 47a0b1970a86b |
14 | 1c64c53818448 |
15 | c5b88550e3c9 |
hex | 616e03523860 |
107125130016864 has 144 divisors (see below), whose sum is σ = 316633091366592. Its totient is φ = 35627769710208.
The previous prime is 107125130016799. The next prime is 107125130016871. The reversal of 107125130016864 is 468610031521701.
107125130016864 is a `hidden beast` number, since 1 + 0 + 7 + 1 + 251 + 300 + 16 + 86 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a super-2 number, since 2×1071251300168642 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12104194 + ... + 18993729.
It is an arithmetic number, because the mean of its divisors is an integer number (2198840912268).
Almost surely, 2107125130016864 is an apocalyptic number.
It is an amenable number.
107125130016864 is an abundant number, since it is smaller than the sum of its proper divisors (209507961349728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107125130016864 is an equidigital number, since it uses as much as digits as its factorization.
107125130016864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31098391 (or 31098371 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The spelling of 107125130016864 in words is "one hundred seven trillion, one hundred twenty-five billion, one hundred thirty million, sixteen thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •