Base | Representation |
---|---|
bin | 1010010001011111010110… |
… | …0111011001011000001110 |
3 | 1110222211220001221122021100 |
4 | 2210113311213121120032 |
5 | 2440031331440013140 |
6 | 40005042230043530 |
7 | 2244036146556606 |
oct | 244276547313016 |
9 | 43884801848240 |
10 | 11295589766670 |
11 | 3665483a47680 |
12 | 13251b21a95a6 |
13 | 63c228648b31 |
14 | 2b09d0a97c06 |
15 | 148c56aac530 |
hex | a45f59d960e |
11295589766670 has 96 divisors (see below), whose sum is σ = 32904302876640. Its totient is φ = 2664316005120.
The previous prime is 11295589766653. The next prime is 11295589766723. The reversal of 11295589766670 is 7666798559211.
It is a Smith number, since the sum of its digits (72) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 154148325 + ... + 154221584.
It is an arithmetic number, because the mean of its divisors is an integer number (342753154965).
Almost surely, 211295589766670 is an apocalyptic number.
11295589766670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11295589766670 is an abundant number, since it is smaller than the sum of its proper divisors (21608713109970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11295589766670 is a wasteful number, since it uses less digits than its factorization.
11295589766670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308369970 (or 308369967 counting only the distinct ones).
The product of its (nonzero) digits is 342921600, while the sum is 72.
The spelling of 11295589766670 in words is "eleven trillion, two hundred ninety-five billion, five hundred eighty-nine million, seven hundred sixty-six thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •