Search a number
-
+
101148961456656 = 2431234492
BaseRepresentation
bin10110111111111010010011…
…111010101100001000010000
3111021010202011001000000000000
4112333322103322230020100
5101224211033113103111
6555043105202130000
730206525362321341
oct2677722372541020
9437122131000000
10101148961456656
112a258040881233
12b41741a650900
1344593c977a239
141ad98c8b080c8
15ba61b386dc56
hex5bfe93eac210

101148961456656 has 195 divisors, whose sum is σ = 294049241220541. Its totient is φ = 33706544805504.

The previous prime is 101148961456651. The next prime is 101148961456681. The reversal of 101148961456656 is 656654169841101.

The square root of 101148961456656 is 10057284.

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

101148961456656 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 4 + 8 + 9 + 6 + 14 + 566 + 56 = 666.

It can be written as a sum of positive squares in only one way, i.e., 527197975056 + 100621763481600 = 726084^2 + 10031040^2 .

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 38 ways as a sum of consecutive naturals, for example, 29327038420 + ... + 29327041868.

Almost surely, 2101148961456656 is an apocalyptic number.

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

101148961456656 is the 10057284-th square number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 37324800, while the sum is 63.

The spelling of 101148961456656 in words is "one hundred one trillion, one hundred forty-eight billion, nine hundred sixty-one million, four hundred fifty-six thousand, six hundred fifty-six".