Base | Representation |
---|---|
bin | 1010011100001110011001… |
… | …1111101011011101101000 |
3 | 1111122110221022100220221000 |
4 | 2213003212133223131220 |
5 | 3001042040014212310 |
6 | 40225503115115000 |
7 | 2263255406140341 |
oct | 247034637533550 |
9 | 44573838326830 |
10 | 11480019679080 |
11 | 3726715909597 |
12 | 1354aa3442a60 |
13 | 65373ac97514 |
14 | 2b98c8d570c8 |
15 | 14d94d15c4c0 |
hex | a70e67eb768 |
11480019679080 has 128 divisors (see below), whose sum is σ = 40517716579200. Its totient is φ = 2881259836416.
The previous prime is 11480019679027. The next prime is 11480019679081. The reversal of 11480019679080 is 8097691008411.
11480019679080 is a `hidden beast` number, since 1 + 1 + 480 + 0 + 1 + 96 + 79 + 0 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (11480019679081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 312618342 + ... + 312655061.
It is an arithmetic number, because the mean of its divisors is an integer number (316544660775).
Almost surely, 211480019679080 is an apocalyptic number.
11480019679080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11480019679080 is an abundant number, since it is smaller than the sum of its proper divisors (29037696900120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11480019679080 is a wasteful number, since it uses less digits than its factorization.
11480019679080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625273440 (or 625273430 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 54.
The spelling of 11480019679080 in words is "eleven trillion, four hundred eighty billion, nineteen million, six hundred seventy-nine thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •