Base | Representation |
---|---|
bin | 111111101010100… |
… | …1011000011001100 |
3 | 12111212202002022010 |
4 | 1333111023003030 |
5 | 13333340203331 |
6 | 551551221220 |
7 | 103636611456 |
oct | 17725130314 |
9 | 5455662263 |
10 | 2136256716 |
11 | 9a6952320 |
12 | 4b7517810 |
13 | 280773939 |
14 | 163a072d6 |
15 | c7829e46 |
hex | 7f54b0cc |
2136256716 has 96 divisors (see below), whose sum is σ = 5878897920. Its totient is φ = 596678400.
The previous prime is 2136256691. The next prime is 2136256723. The reversal of 2136256716 is 6176526312.
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 31 ways as a sum of consecutive naturals, for example, 81286 + ... + 104306.
It is an arithmetic number, because the mean of its divisors is an integer number (61238520).
Almost surely, 22136256716 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2136256716, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2939448960).
2136256716 is an abundant number, since it is smaller than the sum of its proper divisors (3742641204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2136256716 is a wasteful number, since it uses less digits than its factorization.
2136256716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23095 (or 23093 counting only the distinct ones).
The product of its digits is 90720, while the sum is 39.
The square root of 2136256716 is about 46219.6572466737. The cubic root of 2136256716 is about 1287.9069308611.
It can be divided in two parts, 2136 and 256716, that added together give a palindrome (258852).
The spelling of 2136256716 in words is "two billion, one hundred thirty-six million, two hundred fifty-six thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •