Base | Representation |
---|---|
bin | 11111000011100001100… |
… | …110001001001110000000 |
3 | 21120000110022022010020102 |
4 | 133003201212021032000 |
5 | 234431103143323043 |
6 | 4312215314101532 |
7 | 310116464144432 |
oct | 37034146111600 |
9 | 7500408263212 |
10 | 2134088651648 |
11 | 753075454468 |
12 | 2a5725b7a8a8 |
13 | 1263225298b5 |
14 | 7540cd88652 |
15 | 3a7a4c786b8 |
hex | 1f0e1989380 |
2134088651648 has 64 divisors (see below), whose sum is σ = 4471455208320. Its totient is φ = 1013139978240.
The previous prime is 2134088651647. The next prime is 2134088651657. The reversal of 2134088651648 is 8461568804312.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 2134088651593 and 2134088651602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2134088651641) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4863515 + ... + 5284122.
It is an arithmetic number, because the mean of its divisors is an integer number (69866487630).
Almost surely, 22134088651648 is an apocalyptic number.
It is an amenable number.
2134088651648 is an abundant number, since it is smaller than the sum of its proper divisors (2337366556672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2134088651648 is a wasteful number, since it uses less digits than its factorization.
2134088651648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10147735 (or 10147723 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 56.
The spelling of 2134088651648 in words is "two trillion, one hundred thirty-four billion, eighty-eight million, six hundred fifty-one thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •