Base | Representation |
---|---|
bin | 10101001010000110… |
… | …10100101011000100 |
3 | 1002022122001100020000 |
4 | 22211003110223010 |
5 | 141230403440330 |
6 | 5115051441300 |
7 | 551326205115 |
oct | 124503245304 |
9 | 32278040200 |
10 | 11359046340 |
11 | 48a9981704 |
12 | 2250156230 |
13 | 10c042a2c5 |
14 | 79a85420c |
15 | 467363560 |
hex | 2a50d4ac4 |
11359046340 has 240 divisors, whose sum is σ = 37641276288. Its totient is φ = 2861692416.
The previous prime is 11359046323. The next prime is 11359046401. The reversal of 11359046340 is 4364095311.
11359046340 is a `hidden beast` number, since 1 + 1 + 3 + 590 + 4 + 63 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11359046295 and 11359046304.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3090744 + ... + 3094416.
Almost surely, 211359046340 is an apocalyptic number.
11359046340 is a gapful number since it is divisible by the number (10) 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 11359046340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18820638144).
11359046340 is an abundant number, since it is smaller than the sum of its proper divisors (26282229948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11359046340 is a wasteful number, since it uses less digits than its factorization.
11359046340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3800 (or 3789 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 11359046340 in words is "eleven billion, three hundred fifty-nine million, forty-six thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •