Base | Representation |
---|---|
bin | 1000000100010000… |
… | …1011010111100000 |
3 | 12120220111111000101 |
4 | 2001010023113200 |
5 | 13413312343000 |
6 | 554511032144 |
7 | 104442136153 |
oct | 20104132740 |
9 | 5526444011 |
10 | 2165356000 |
11 | a11318015 |
12 | 50520b654 |
13 | 2867c1952 |
14 | 16781dc9a |
15 | ca176e6a |
hex | 8110b5e0 |
2165356000 has 48 divisors (see below), whose sum is σ = 5320289520. Its totient is φ = 866140800.
The previous prime is 2165355967. The next prime is 2165356007. The reversal of 2165356000 is 6535612.
It is a self number, because there is not a number n which added to its sum of digits gives 2165356000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2165356007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 266670 + ... + 274669.
It is an arithmetic number, because the mean of its divisors is an integer number (110839365).
Almost surely, 22165356000 is an apocalyptic number.
2165356000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2165356000 is an abundant number, since it is smaller than the sum of its proper divisors (3154933520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2165356000 is an equidigital number, since it uses as much as digits as its factorization.
2165356000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 541364 (or 541346 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 2165356000 is about 46533.3858643448. The cubic root of 2165356000 is about 1293.7283721403.
The spelling of 2165356000 in words is "two billion, one hundred sixty-five million, three hundred fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •