Base | Representation |
---|---|
bin | 100110111010101101100… |
… | …010110100100100011100 |
3 | 100110200001020010122012010 |
4 | 212322231202310210130 |
5 | 322304113044312300 |
6 | 5404332131311220 |
7 | 364134442334634 |
oct | 46725542644434 |
9 | 10420036118163 |
10 | 2674381244700 |
11 | 941220545440 |
12 | 372390a4b510 |
13 | 1652682334b9 |
14 | 936255816c4 |
15 | 49877ddca50 |
hex | 26ead8b491c |
2674381244700 has 144 divisors (see below), whose sum is σ = 8493108656256. Its totient is φ = 644357203200.
The previous prime is 2674381244687. The next prime is 2674381244747. The reversal of 2674381244700 is 74421834762.
2674381244700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 2674381244700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1948047 + ... + 3023846.
It is an arithmetic number, because the mean of its divisors is an integer number (58979921224).
Almost surely, 22674381244700 is an apocalyptic number.
2674381244700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2674381244700 is an abundant number, since it is smaller than the sum of its proper divisors (5818727411556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2674381244700 is a wasteful number, since it uses less digits than its factorization.
2674381244700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4972084 (or 4972077 counting only the distinct ones).
The product of its (nonzero) digits is 1806336, while the sum is 48.
The spelling of 2674381244700 in words is "two trillion, six hundred seventy-four billion, three hundred eighty-one million, two hundred forty-four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •