Search a number
-
+
10657645152 = 2537112131071
BaseRepresentation
bin10011110110011111…
…01100001001100000
31000111202020110200020
421323033230021200
5133311324121102
64521314153440
7525051326520
oct117317541140
930452213606
1010657645152
114579a65600
122095282880
13100b01a20b
14731633680
154259b5bbc
hex27b3ec260

10657645152 has 144 divisors (see below), whose sum is σ = 35144073216. Its totient is φ = 2768198400.

The previous prime is 10657645123. The next prime is 10657645157. The reversal of 10657645152 is 25154675601.

10657645152 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×106576451522 (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10657645157) by changing a digit.

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 23 ways as a sum of consecutive naturals, for example, 15777 + ... + 146847.

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

Almost surely, 210657645152 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The sum of its prime factors is 131113 (or 131094 counting only the distinct ones).

The product of its (nonzero) digits is 252000, while the sum is 42.

It can be divided in two parts, 1065764 and 5152, that added together give a triangular number (1070916 = T1463).

The spelling of 10657645152 in words is "ten billion, six hundred fifty-seven million, six hundred forty-five thousand, one hundred fifty-two".

Divisors: 1 2 3 4 6 7 8 11 12 14 16 21 22 24 28 32 33 42 44 48 56 66 77 84 88 96 112 121 132 154 168 176 224 231 242 264 308 336 352 363 462 484 528 616 672 726 847 924 968 1056 1232 1452 1694 1848 1936 2464 2541 2904 3388 3696 3872 5082 5808 6776 7392 10164 11616 13552 20328 27104 40656 81312 131071 262142 393213 524284 786426 917497 1048568 1441781 1572852 1834994 2097136 2752491 2883562 3145704 3669988 4194272 4325343 5504982 5767124 6291408 7339976 8650686 10092467 11009964 11534248 12582816 14679952 15859591 17301372 20184934 22019928 23068496 29359904 30277401 31719182 34602744 40369868 44039856 46136992 47578773 60554802 63438364 69205488 80739736 88079712 95157546 111017137 121109604 126876728 138410976 161479472 190315092 222034274 242219208 253753456 322958944 333051411 380630184 444068548 484438416 507506912 666102822 761260368 888137096 968876832 1332205644 1522520736 1776274192 2664411288 3552548384 5328822576 10657645152