Base | Representation |
---|---|
bin | 11111011001011100100010… |
… | …100110010100000010101000 |
3 | 200002221002110022011121000102 |
4 | 133121130202212110002220 |
5 | 121044413333421040400 |
6 | 1205404441353324532 |
7 | 41041351126326551 |
oct | 3731344246240250 |
9 | 602832408147012 |
10 | 138088074002600 |
11 | 3aaa990690a167 |
12 | 135a2488706748 |
13 | 5c08859c64887 |
14 | 26156d9a25328 |
15 | 10e6ec37449d5 |
hex | 7d97229940a8 |
138088074002600 has 96 divisors (see below), whose sum is σ = 328674648788640. Its totient is φ = 53925483360000.
The previous prime is 138088074002537. The next prime is 138088074002647. The reversal of 138088074002600 is 6200470880831.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14662775 + ... + 22162425.
It is an arithmetic number, because the mean of its divisors is an integer number (3423694258215).
Almost surely, 2138088074002600 is an apocalyptic number.
138088074002600 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 138088074002600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164337324394320).
138088074002600 is an abundant number, since it is smaller than the sum of its proper divisors (190586574786040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138088074002600 is a wasteful number, since it uses less digits than its factorization.
138088074002600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7501851 (or 7501842 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 47.
The spelling of 138088074002600 in words is "one hundred thirty-eight trillion, eighty-eight billion, seventy-four million, two thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •