Base | Representation |
---|---|
bin | 10101111110001101… |
… | …10010001101010000 |
3 | 1010110002120002022012 |
4 | 22333012302031100 |
5 | 143124304130420 |
6 | 5230304402052 |
7 | 565214500664 |
oct | 127706621520 |
9 | 33402502265 |
10 | 11796161360 |
11 | 5003697695 |
12 | 2352616328 |
13 | 115cb65249 |
14 | 7dc91a8a4 |
15 | 490908dc5 |
hex | 2bf1b2350 |
11796161360 has 20 divisors (see below), whose sum is σ = 27426075348. Its totient is φ = 4718464512.
The previous prime is 11796161359. The next prime is 11796161383. The reversal of 11796161360 is 6316169711.
11796161360 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4825247296 + 6970914064 = 69464^2 + 83492^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73725929 + ... + 73726088.
Almost surely, 211796161360 is an apocalyptic number.
11796161360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11796161360 is an abundant number, since it is smaller than the sum of its proper divisors (15629913988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11796161360 is a wasteful number, since it uses less digits than its factorization.
11796161360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147452030 (or 147452024 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 41.
The spelling of 11796161360 in words is "eleven billion, seven hundred ninety-six million, one hundred sixty-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •