Base | Representation |
---|---|
bin | 1101111000110101011111… |
… | …1011101001111000000000 |
3 | 2000001210202102000210110200 |
4 | 3132031113323221320000 |
5 | 4000141113000234323 |
6 | 52250551342525200 |
7 | 3134140626230061 |
oct | 336152773517000 |
9 | 60053672023420 |
10 | 15270083993088 |
11 | 4958008362021 |
12 | 1867540296800 |
13 | 869c691b4042 |
14 | 3ab10c7d4568 |
15 | 1b732378b443 |
hex | de357ee9e00 |
15270083993088 has 120 divisors (see below), whose sum is σ = 44077445216376. Its totient is φ = 5089225420800.
The previous prime is 15270083993081. The next prime is 15270083993093. The reversal of 15270083993088 is 88039938007251.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15270083993081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29329923 + ... + 29846013.
Almost surely, 215270083993088 is an apocalyptic number.
15270083993088 is a gapful number since it is divisible by the number (18) 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 15270083993088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22038722608188).
15270083993088 is an abundant number, since it is smaller than the sum of its proper divisors (28807361223288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15270083993088 is an equidigital number, since it uses as much as digits as its factorization.
15270083993088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 522536 (or 522517 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 63.
The spelling of 15270083993088 in words is "fifteen trillion, two hundred seventy billion, eighty-three million, nine hundred ninety-three thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •