Base | Representation |
---|---|
bin | 10000010110111100111… |
… | …001100000011101101001 |
3 | 10222110122100012020101012 |
4 | 100112330321200131221 |
5 | 121404232321443131 |
6 | 2220232513033305 |
7 | 144134424262505 |
oct | 20267471403551 |
9 | 3873570166335 |
10 | 1124155656041 |
11 | 3a382a6199a0 |
12 | 161a51555835 |
13 | 82013403a82 |
14 | 3c5a3661305 |
15 | 1e39648c52b |
hex | 105bce60769 |
1124155656041 has 8 divisors (see below), whose sum is σ = 1226393986368. Its totient is φ = 1021924386000.
The previous prime is 1124155656023. The next prime is 1124155656101. The reversal of 1124155656041 is 1406565514211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1124155656041 - 230 = 1123081914217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1124155656041.
It is not an unprimeable number, because it can be changed into a prime (1124155656341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1429370 + ... + 2071571.
It is an arithmetic number, because the mean of its divisors is an integer number (153299248296).
Almost surely, 21124155656041 is an apocalyptic number.
1124155656041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1124155656041 is a deficient number, since it is larger than the sum of its proper divisors (102238330327).
1124155656041 is a wasteful number, since it uses less digits than its factorization.
1124155656041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3530143.
The product of its (nonzero) digits is 144000, while the sum is 41.
The spelling of 1124155656041 in words is "one trillion, one hundred twenty-four billion, one hundred fifty-five million, six hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •