Search a number
-
+
11311013310 = 23519593171061
BaseRepresentation
bin10101000100011000…
…00101110110111110
31002012021200000021220
422202030011312332
5141131104411220
65110214134210
7550204012122
oct124214056676
932167600256
1011311013310
114884854793
122238051366
1310b34b02ac
1479430d582
15463026540
hex2a2305dbe

11311013310 has 128 divisors (see below), whose sum is σ = 29178662400. Its totient is φ = 2797585920.

The previous prime is 11311013299. The next prime is 11311013333. The reversal of 11311013310 is 1331011311.

11311013310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×113110133102 (a number of 21 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 11311013310.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10660180 + ... + 10661240.

It is an arithmetic number, because the mean of its divisors is an integer number (227958300).

Almost surely, 211311013310 is an apocalyptic number.

11311013310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 11311013310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14589331200).

11311013310 is an abundant number, since it is smaller than the sum of its proper divisors (17867649090).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

11311013310 is a wasteful number, since it uses less digits than its factorization.

11311013310 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1466.

The product of its (nonzero) digits is 27, while the sum is 15.

Adding to 11311013310 its reverse (1331011311), we get a palindrome (12642024621).

The spelling of 11311013310 in words is "eleven billion, three hundred eleven million, thirteen thousand, three hundred ten".

Divisors: 1 2 3 5 6 10 15 19 30 38 57 59 95 114 118 177 190 285 295 317 354 570 590 634 885 951 1061 1121 1585 1770 1902 2122 2242 3170 3183 3363 4755 5305 5605 6023 6366 6726 9510 10610 11210 12046 15915 16815 18069 18703 20159 30115 31830 33630 36138 37406 40318 56109 60230 60477 62599 90345 93515 100795 112218 120954 125198 180690 187030 187797 201590 280545 302385 312995 336337 355357 375594 561090 604770 625990 672674 710714 938985 1009011 1066071 1189381 1681685 1776785 1877970 2018022 2132142 2378762 3363370 3553570 3568143 5045055 5330355 5946905 6390403 7136286 10090110 10660710 11893810 12780806 17840715 19171209 19843883 31952015 35681430 38342418 39687766 59531649 63904030 95856045 99219415 119063298 191712090 198438830 297658245 377033777 595316490 754067554 1131101331 1885168885 2262202662 3770337770 5655506655 11311013310