Base | Representation |
---|---|
bin | 10000001100101100111… |
… | …100010010100111100000 |
3 | 10221102020101010000100212 |
4 | 100030230330102213200 |
5 | 121214213014011224 |
6 | 2211212503033252 |
7 | 143264623256114 |
oct | 20145474224740 |
9 | 3842211100325 |
10 | 1113150532064 |
11 | 39a0a250140a |
12 | 15b89ba3b828 |
13 | 80c7b4040ac |
14 | 3bc3bc19744 |
15 | 1de50239d0e |
hex | 1032cf129e0 |
1113150532064 has 24 divisors (see below), whose sum is σ = 2198136022488. Its totient is φ = 554893764480.
The previous prime is 1113150532027. The next prime is 1113150532079. The reversal of 1113150532064 is 4602350513111.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 1113150532064.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52536167 + ... + 52557350.
It is an arithmetic number, because the mean of its divisors is an integer number (91589000937).
Almost surely, 21113150532064 is an apocalyptic number.
It is an amenable number.
1113150532064 is a deficient number, since it is larger than the sum of its proper divisors (1084985490424).
1113150532064 is a wasteful number, since it uses less digits than its factorization.
1113150532064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105093858 (or 105093850 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 1113150532064 in words is "one trillion, one hundred thirteen billion, one hundred fifty million, five hundred thirty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •