Base | Representation |
---|---|
bin | 10000000101010011010… |
… | …110100011010001111000 |
3 | 10220122201122012221220222 |
4 | 100011103112203101320 |
5 | 121101424441000142 |
6 | 2203420231035212 |
7 | 142564003426232 |
oct | 20052326432170 |
9 | 3818648187828 |
10 | 1105205015672 |
11 | 39679546733a |
12 | 15a242b0bb08 |
13 | 802b32590c4 |
14 | 3b6c6895252 |
15 | 1db37902bd2 |
hex | 101535a3478 |
1105205015672 has 64 divisors (see below), whose sum is σ = 2117088783360. Its totient is φ = 540706816000.
The previous prime is 1105205015639. The next prime is 1105205015687. The reversal of 1105205015672 is 2765105025011.
It is a super-3 number, since 3×11052050156723 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 15 ways as a sum of consecutive naturals, for example, 312821618 + ... + 312825150.
It is an arithmetic number, because the mean of its divisors is an integer number (33079512240).
Almost surely, 21105205015672 is an apocalyptic number.
It is an amenable number.
1105205015672 is a deficient number, since it is larger than the sum of its proper divisors (1011883767688).
1105205015672 is a wasteful number, since it uses less digits than its factorization.
1105205015672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5384 (or 5380 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 35.
The spelling of 1105205015672 in words is "one trillion, one hundred five billion, two hundred five million, fifteen thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.476 sec. • engine limits •