Search a number
-
+
10105506935056 = 2413211325412
BaseRepresentation
bin1001001100001101111100…
…1001101011000100010000
31022210002002011010212210201
42103003133021223010100
52311032034233410211
633254223352504544
72062045611450121
oct223033711530420
938702064125721
1010105506935056
1132467a323aa15
1211726219ab154
13583c39839400
1426d1756d0048
15127d0286c0c1
hex930df26b110

10105506935056 has 135 divisors (see below), whose sum is σ = 21430278899757. Its totient is φ = 4614260152320.

The previous prime is 10105506935011. The next prime is 10105506935059. The reversal of 10105506935056 is 65053960550101.

The square root of 10105506935056 is 3178916.

It is a perfect power (a square), and thus also a powerful number.

It can be written as a sum of positive squares in 13 ways, for example, as 8845365981456 + 1260140953600 = 2974116^2 + 1122560^2 .

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

It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.

It is a junction number, because it is equal to n+sod(n) for n = 10105506934997 and 10105506935015.

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

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

It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 18679310146 + ... + 18679310686.

Almost surely, 210105506935056 is an apocalyptic number.

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

10105506935056 is the 3178916-th square number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10105506935056

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

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

10105506935056 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 607500, while the sum is 46.

The spelling of 10105506935056 in words is "ten trillion, one hundred five billion, five hundred six million, nine hundred thirty-five thousand, fifty-six".

Divisors: 1 2 4 8 13 16 26 52 104 113 169 208 226 338 452 541 676 904 1082 1352 1469 1808 2164 2704 2938 4328 5876 7033 8656 11752 12769 14066 19097 23504 25538 28132 38194 51076 56264 61133 76388 91429 102152 112528 122266 152776 165997 182858 204304 244532 292681 305552 331994 365716 489064 585362 663988 731432 794729 978128 1170724 1327976 1462864 1589458 2157961 2341448 2655952 3178916 3804853 4315922 4682896 6357832 6908029 7609706 8631844 10331477 12715664 13816058 15219412 17263688 20662954 27632116 30438824 33072953 34527376 41325908 49463089 55264232 60877648 66145906 82651816 89804377 98926178 110528464 132291812 165303632 179608754 197852356 264583624 359217508 395704712 429948389 529167248 718435016 791409424 859896778 1167456901 1436870032 1719793556 2334913802 3439587112 3737243689 4669827604 5589329057 6879174224 7474487378 9339655208 11178658114 14948974756 18679310416 22357316228 29897949512 44714632456 48584167957 59795899024 89429264912 97168335914 194336671828 388673343656 631594183441 777346687312 1263188366882 2526376733764 5052753467528 10105506935056