Base | Representation |
---|---|
bin | 1010010001110100101000… |
… | …0110001110100001010100 |
3 | 1111000101122011201100100020 |
4 | 2210131022012032201110 |
5 | 2440130031314231400 |
6 | 40011425125145140 |
7 | 2244330541613013 |
oct | 244351206164124 |
9 | 44011564640306 |
10 | 11301302102100 |
11 | 366794545984a |
12 | 132632725b1b0 |
13 | 63c928c4567a |
14 | 2b0db35c4a7a |
15 | 148e8d3212a0 |
hex | a474a18e854 |
11301302102100 has 36 divisors (see below), whose sum is σ = 32698434082944. Its totient is φ = 3013680560480.
The previous prime is 11301302102089. The next prime is 11301302102147. The reversal of 11301302102100 is 120120310311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11301302102100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18835503204 + ... + 18835503803.
Almost surely, 211301302102100 is an apocalyptic number.
11301302102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11301302102100 is an abundant number, since it is smaller than the sum of its proper divisors (21397131980844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11301302102100 is a wasteful number, since it uses less digits than its factorization.
11301302102100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37671007024 (or 37671007017 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11301302102100 its reverse (120120310311), we get a palindrome (11421422412411).
The spelling of 11301302102100 in words is "eleven trillion, three hundred one billion, three hundred two million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •