Base | Representation |
---|---|
bin | 10000000001011011110… |
… | …001001010001110111000 |
3 | 10220021000011011100211102 |
4 | 100001123301022032320 |
5 | 121014423104211100 |
6 | 2201452125150532 |
7 | 142356035063165 |
oct | 20013361121670 |
9 | 3807004140742 |
10 | 1101051241400 |
11 | 394a537a3240 |
12 | 1594839bb448 |
13 | 7caa08168c6 |
14 | 3b410d5306c |
15 | 1d992e04cd5 |
hex | 1005bc4a3b8 |
1101051241400 has 48 divisors (see below), whose sum is σ = 2792666336040. Its totient is φ = 400382268800.
The previous prime is 1101051241291. The next prime is 1101051241417. The reversal of 1101051241400 is 41421501011.
It is a super-4 number, since 4×11010512414004 (a number of 49 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 11 ways as a sum of consecutive naturals, for example, 250236719 + ... + 250241118.
Almost surely, 21101051241400 is an apocalyptic number.
1101051241400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101051241400 is an abundant number, since it is smaller than the sum of its proper divisors (1691615094640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101051241400 is a wasteful number, since it uses less digits than its factorization.
1101051241400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500477864 (or 500477855 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 20.
Adding to 1101051241400 its reverse (41421501011), we get a palindrome (1142472742411).
The spelling of 1101051241400 in words is "one trillion, one hundred one billion, fifty-one million, two hundred forty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •