Base | Representation |
---|---|
bin | 1010010001010111011111… |
… | …0011011000101011010100 |
3 | 1110222122102222010120201200 |
4 | 2210111313303120223110 |
5 | 2440013021104332213 |
6 | 40004052544352500 |
7 | 2243632636306530 |
oct | 244256763305324 |
9 | 43878388116650 |
10 | 11293478980308 |
11 | 36645a0511638 |
12 | 1324903315730 |
13 | 63bc80252515 |
14 | 2b0870600bc0 |
15 | 148b81614273 |
hex | a4577cd8ad4 |
11293478980308 has 72 divisors (see below), whose sum is σ = 32749657868928. Its totient is φ = 3214439408448.
The previous prime is 11293478980237. The next prime is 11293478980321. The reversal of 11293478980308 is 80308987439211.
11293478980308 is a `hidden beast` number, since 1 + 129 + 3 + 478 + 9 + 8 + 0 + 30 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 85134091 + ... + 85266642.
Almost surely, 211293478980308 is an apocalyptic number.
11293478980308 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11293478980308 is an abundant number, since it is smaller than the sum of its proper divisors (21456178888620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11293478980308 is a wasteful number, since it uses less digits than its factorization.
11293478980308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170401013 (or 170401008 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 63.
The spelling of 11293478980308 in words is "eleven trillion, two hundred ninety-three billion, four hundred seventy-eight million, nine hundred eighty thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •