Base | Representation |
---|---|
bin | 11001000101011100101110… |
… | …011011111010000100001110 |
3 | 112110122000200000220202221000 |
4 | 121011130232123322010032 |
5 | 103430033314111000024 |
6 | 1030350514403321130 |
7 | 32144522213042454 |
oct | 3105345633720416 |
9 | 473560600822830 |
10 | 110325604000014 |
11 | 3217590a303687 |
12 | 10459a116801a6 |
13 | 4973876802a20 |
14 | 1d35b057349d4 |
15 | cb4c4eb01cc9 |
hex | 64572e6fa10e |
110325604000014 has 32 divisors (see below), whose sum is σ = 264027086497440. Its totient is φ = 33946339692096.
The previous prime is 110325603999931. The next prime is 110325604000049. The reversal of 110325604000014 is 410000406523011.
It is a happy number.
110325604000014 is a `hidden beast` number, since 1 + 1 + 0 + 3 + 256 + 0 + 400 + 0 + 0 + 1 + 4 = 666.
It is a super-3 number, since 3×1103256040000143 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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, 78579489327 + ... + 78579490730.
It is an arithmetic number, because the mean of its divisors is an integer number (8250846453045).
Almost surely, 2110325604000014 is an apocalyptic number.
110325604000014 is an abundant number, since it is smaller than the sum of its proper divisors (153701482497426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110325604000014 is a wasteful number, since it uses less digits than its factorization.
110325604000014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157158980081 (or 157158980075 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 110325604000014 in words is "one hundred ten trillion, three hundred twenty-five billion, six hundred four million, fourteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •