Base | Representation |
---|---|
bin | 1010000111110111010101… |
… | …1011001101001111000110 |
3 | 1110102001001212222220201110 |
4 | 2201331311123031033012 |
5 | 2424324202431032220 |
6 | 35401053543305450 |
7 | 2226063324550530 |
oct | 241756533151706 |
9 | 43361055886643 |
10 | 11130230330310 |
11 | 3601338947673 |
12 | 12b914374b286 |
13 | 629764c422c0 |
14 | 2a69c547a850 |
15 | 1447c9868be0 |
hex | a1f756cd3c6 |
11130230330310 has 128 divisors (see below), whose sum is σ = 32971737222144. Its totient is φ = 2341588492800.
The previous prime is 11130230330309. The next prime is 11130230330353. The reversal of 11130230330310 is 1303303203111.
It is a super-2 number, since 2×111302303303102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4927341 + ... + 6821960.
It is an arithmetic number, because the mean of its divisors is an integer number (257591697048).
Almost surely, 211130230330310 is an apocalyptic number.
11130230330310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11130230330310 is an abundant number, since it is smaller than the sum of its proper divisors (21841506891834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130230330310 is a wasteful number, since it uses less digits than its factorization.
11130230330310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11749678.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11130230330310 its reverse (1303303203111), we get a palindrome (12433533533421).
The spelling of 11130230330310 in words is "eleven trillion, one hundred thirty billion, two hundred thirty million, three hundred thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •