Base | Representation |
---|---|
bin | 101000001110110100000… |
… | …100110111101110110100 |
3 | 100210022010122212011222102 |
4 | 220032310010313232310 |
5 | 330244033344201220 |
6 | 5514025005321232 |
7 | 403512322003124 |
oct | 50166404675664 |
9 | 10708118764872 |
10 | 2764685147060 |
11 | 976550765901 |
12 | 387993566218 |
13 | 170929cbb855 |
14 | 97b5098ac84 |
15 | 4bdb0c99775 |
hex | 283b4137bb4 |
2764685147060 has 24 divisors (see below), whose sum is σ = 5940858317856. Its totient is φ = 1080156057120.
The previous prime is 2764685147057. The next prime is 2764685147083. The reversal of 2764685147060 is 607415864672.
2764685147060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 2764685146987 and 2764685147005.
It is a congruent number.
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, 1607374226 + ... + 1607375945.
It is an arithmetic number, because the mean of its divisors is an integer number (247535763244).
Almost surely, 22764685147060 is an apocalyptic number.
2764685147060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2764685147060 is an abundant number, since it is smaller than the sum of its proper divisors (3176173170796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2764685147060 is a wasteful number, since it uses less digits than its factorization.
2764685147060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3214750223 (or 3214750221 counting only the distinct ones).
The product of its (nonzero) digits is 13547520, while the sum is 56.
The spelling of 2764685147060 in words is "two trillion, seven hundred sixty-four billion, six hundred eighty-five million, one hundred forty-seven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •