Base | Representation |
---|---|
bin | 1010110101000010100001… |
… | …0111010101100111011000 |
3 | 1120011020022100221211222110 |
4 | 2231100220113111213120 |
5 | 3030033124044113000 |
6 | 41153405122552320 |
7 | 2336126604564060 |
oct | 255205027254730 |
9 | 46136270854873 |
10 | 11906326551000 |
11 | 3880498a39152 |
12 | 14036388086a0 |
13 | 6849b9811b5b |
14 | 2d23aac923a0 |
15 | 159a9e324850 |
hex | ad4285d59d8 |
11906326551000 has 128 divisors (see below), whose sum is σ = 42454558748160. Its totient is φ = 2721446064000.
The previous prime is 11906326550927. The next prime is 11906326551013. The reversal of 11906326551000 is 15562360911.
It is a happy number.
It is a super-2 number, since 2×119063265510002 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11906326551000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 283462966 + ... + 283504965.
It is an arithmetic number, because the mean of its divisors is an integer number (331676240220).
Almost surely, 211906326551000 is an apocalyptic number.
11906326551000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11906326551000 is an abundant number, since it is smaller than the sum of its proper divisors (30548232197160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11906326551000 is a wasteful number, since it uses less digits than its factorization.
11906326551000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566967962 (or 566967948 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 39.
The spelling of 11906326551000 in words is "eleven trillion, nine hundred six billion, three hundred twenty-six million, five hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •