Base | Representation |
---|---|
bin | 10000010100011010101… |
… | …100010010000000001110 |
3 | 10222012121200110000012010 |
4 | 100110122230102000032 |
5 | 121333144133424300 |
6 | 2215102500322050 |
7 | 144010121046435 |
oct | 20243254220016 |
9 | 3865550400163 |
10 | 1121434279950 |
11 | 3a2663462846 |
12 | 1614120a3326 |
13 | 8199b67476a |
14 | 3c3c606611c |
15 | 1e2875d3a50 |
hex | 1051ab1200e |
1121434279950 has 48 divisors (see below), whose sum is σ = 2944754492400. Its totient is φ = 281458014720.
The previous prime is 1121434279949. The next prime is 1121434279993. The reversal of 1121434279950 is 599724341211.
It is a super-3 number, since 3×11214342799503 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1121434279950.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 219886525 + ... + 219891624.
It is an arithmetic number, because the mean of its divisors is an integer number (61349051925).
Almost surely, 21121434279950 is an apocalyptic number.
1121434279950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1121434279950 is an abundant number, since it is smaller than the sum of its proper divisors (1823320212450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121434279950 is a wasteful number, since it uses less digits than its factorization.
1121434279950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439778181 (or 439778176 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 48.
The spelling of 1121434279950 in words is "one trillion, one hundred twenty-one billion, four hundred thirty-four million, two hundred seventy-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •