Base | Representation |
---|---|
bin | 1100101001111101011010… |
… | …10001000101111110100000 |
3 | 10122112112002112221200002120 |
4 | 12110332231101011332200 |
5 | 12121431320003100310 |
6 | 135104531525144240 |
7 | 5601436226222034 |
oct | 624765521057640 |
9 | 118475075850076 |
10 | 27830000050080 |
11 | 895a700557798 |
12 | 315578285b080 |
13 | 126b485c6a847 |
14 | 6c2d9cc781c4 |
15 | 333dc74b0b70 |
hex | 194fad445fa0 |
27830000050080 has 96 divisors (see below), whose sum is σ = 89529702361344. Its totient is φ = 7263432631296.
The previous prime is 27830000050049. The next prime is 27830000050087. The reversal of 27830000050080 is 8005000003872.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (27830000050087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 616777087 + ... + 616822206.
It is an arithmetic number, because the mean of its divisors is an integer number (932601066264).
Almost surely, 227830000050080 is an apocalyptic number.
27830000050080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27830000050080 is an abundant number, since it is smaller than the sum of its proper divisors (61699702311264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27830000050080 is a wasteful number, since it uses less digits than its factorization.
27830000050080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1233599358 (or 1233599350 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 33.
The spelling of 27830000050080 in words is "twenty-seven trillion, eight hundred thirty billion, fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •