Search a number
-
+
101691006273120 = 2535111031096732549
BaseRepresentation
bin10111000111110011001000…
…010011100100011001100000
3111100001120021001221200121010
4113013303020103210121200
5101312101140101214440
61000140111531500520
730263634635251605
oct2707631023443140
9440046231850533
10101691006273120
112a446a05a64630
12b4a44942b7740
1344985614b6824
141b17c29cdc6ac
15bb533a750580
hex5c7cc84e4660

101691006273120 has 768 divisors, whose sum is σ = 356746021632000. Its totient is φ = 24143631482880.

The previous prime is 101691006273083. The next prime is 101691006273193. The reversal of 101691006273120 is 21372600196101.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 39894469606 + ... + 39894472154.

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

Almost surely, 2101691006273120 is an apocalyptic number.

101691006273120 is a gapful number since it is divisible by the number (10) 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 101691006273120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178373010816000).

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

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

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 39.

The spelling of 101691006273120 in words is "one hundred one trillion, six hundred ninety-one billion, six million, two hundred seventy-three thousand, one hundred twenty".