Base | Representation |
---|---|
bin | 10000000001011011110… |
… | …001001010110111111000 |
3 | 10220021000011011111102121 |
4 | 100001123301022313320 |
5 | 121014423104302044 |
6 | 2201452125211024 |
7 | 142356035103634 |
oct | 20013361126770 |
9 | 3807004144377 |
10 | 1101051244024 |
11 | 394a537a5206 |
12 | 159483a00a74 |
13 | 7caa0817b64 |
14 | 3b410d53dc4 |
15 | 1d992e05984 |
hex | 1005bc4adf8 |
1101051244024 has 8 divisors (see below), whose sum is σ = 2064471082560. Its totient is φ = 550525622008.
The previous prime is 1101051244021. The next prime is 1101051244057. The reversal of 1101051244024 is 4204421501011.
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 1101051244024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101051244021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68815702744 + ... + 68815702759.
It is an arithmetic number, because the mean of its divisors is an integer number (258058885320).
Almost surely, 21101051244024 is an apocalyptic number.
It is an amenable number.
1101051244024 is a deficient number, since it is larger than the sum of its proper divisors (963419838536).
1101051244024 is a wasteful number, since it uses less digits than its factorization.
1101051244024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137631405509 (or 137631405505 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 1101051244024 its reverse (4204421501011), we get a palindrome (5305472745035).
The spelling of 1101051244024 in words is "one trillion, one hundred one billion, fifty-one million, two hundred forty-four thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •