Base | Representation |
---|---|
bin | 1010001100100101011010… |
… | …1111101111111010000010 |
3 | 1110200210101011111221200220 |
4 | 2203021112233233322002 |
5 | 2432141240410001010 |
6 | 35502224224323510 |
7 | 2234663650432215 |
oct | 243112657577202 |
9 | 43623334457626 |
10 | 11211320000130 |
11 | 363276a952818 |
12 | 13109b4473596 |
13 | 6342b8a4bb53 |
14 | 2aa8b8c2577c |
15 | 14697382c970 |
hex | a3256befe82 |
11211320000130 has 64 divisors (see below), whose sum is σ = 27159795538560. Its totient is φ = 2961617992704.
The previous prime is 11211320000113. The next prime is 11211320000159. The reversal of 11211320000130 is 3100002311211.
It is a happy number.
It is a super-2 number, since 2×112113200001302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 93469836 + ... + 93589704.
It is an arithmetic number, because the mean of its divisors is an integer number (424371805290).
Almost surely, 211211320000130 is an apocalyptic number.
11211320000130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11211320000130 is an abundant number, since it is smaller than the sum of its proper divisors (15948475538430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211320000130 is a wasteful number, since it uses less digits than its factorization.
11211320000130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149123.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11211320000130 its reverse (3100002311211), we get a palindrome (14311322311341).
The spelling of 11211320000130 in words is "eleven trillion, two hundred eleven billion, three hundred twenty million, one hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •