Search a number
-
+
6266192146032 = 24372132315159009
BaseRepresentation
bin101101100101111011000…
…1010000010111001110000
3211012001010201000122121210
41123023312022002321300
51310131130142133112
621154352100320120
71214501040264600
oct133136612027160
924161121018553
106266192146032
111aa652811a675
1285251b0a3040
13365b8cc3c390
141793dccacc00
15acee859eb3c
hex5b2f6282e70

6266192146032 has 480 divisors, whose sum is σ = 21301246632960. Its totient is φ = 1570273689600.

The previous prime is 6266192146013. The next prime is 6266192146043. The reversal of 6266192146032 is 2306412916626.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 106160944 + ... + 106219952.

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

Almost surely, 26266192146032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1119744, while the sum is 48.

The spelling of 6266192146032 in words is "six trillion, two hundred sixty-six billion, one hundred ninety-two million, one hundred forty-six thousand, thirty-two".