Base | Representation |
---|---|
bin | 1001110110110010… |
… | …1101011000100000 |
3 | 20211101102200021112 |
4 | 2131230231120200 |
5 | 20404302240021 |
6 | 1114311242452 |
7 | 122364305561 |
oct | 23554553040 |
9 | 6741380245 |
10 | 2645743136 |
11 | 11384a8a83 |
12 | 61a079428 |
13 | 33219a8aa |
14 | 1b154c168 |
15 | 107418d5b |
hex | 9db2d620 |
2645743136 has 48 divisors (see below), whose sum is σ = 5317008480. Its totient is φ = 1295562240.
The previous prime is 2645743073. The next prime is 2645743159. The reversal of 2645743136 is 6313475462.
It is a super-2 number, since 2×26457431362 = 13999913483382228992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2645743093 and 2645743102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 528035 + ... + 533021.
It is an arithmetic number, because the mean of its divisors is an integer number (110771010).
Almost surely, 22645743136 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 2645743136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2658504240).
2645743136 is an abundant number, since it is smaller than the sum of its proper divisors (2671265344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2645743136 is a wasteful number, since it uses less digits than its factorization.
2645743136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5337 (or 5329 counting only the distinct ones).
The product of its digits is 362880, while the sum is 41.
The square root of 2645743136 is about 51436.7877690666. The cubic root of 2645743136 is about 1383.0861297403.
The spelling of 2645743136 in words is "two billion, six hundred forty-five million, seven hundred forty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •