Base | Representation |
---|---|
bin | 1010010001101000101100… |
… | …1010111101100001100110 |
3 | 1111000002100221022120012101 |
4 | 2210122023022331201212 |
5 | 2440102001304114300 |
6 | 40010135221242314 |
7 | 2244155265034450 |
oct | 244321312754146 |
9 | 44002327276171 |
10 | 11298098894950 |
11 | 366655131590a |
12 | 132579256339a |
13 | 63c53842311a |
14 | 2b0b8c0032d0 |
15 | 148d51edcb6a |
hex | a468b2bd866 |
11298098894950 has 48 divisors (see below), whose sum is σ = 24354791265024. Its totient is φ = 3819075674400.
The previous prime is 11298098894903. The next prime is 11298098895019. The reversal of 11298098894950 is 5949889089211.
It is a happy number.
It is a super-2 number, since 2×112980988949502 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (73) coincides with the sum of the digits of its prime factors.
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, 227301084 + ... + 227350783.
It is an arithmetic number, because the mean of its divisors is an integer number (507391484688).
Almost surely, 211298098894950 is an apocalyptic number.
11298098894950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11298098894950 is an abundant number, since it is smaller than the sum of its proper divisors (13056692370074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11298098894950 is a wasteful number, since it uses less digits than its factorization.
11298098894950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454651957 (or 454651952 counting only the distinct ones).
The product of its (nonzero) digits is 134369280, while the sum is 73.
The spelling of 11298098894950 in words is "eleven trillion, two hundred ninety-eight billion, ninety-eight million, eight hundred ninety-four thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •