Base | Representation |
---|---|
bin | 100110111000100111011… |
… | …001110010100001110100 |
3 | 100110110020101101122112112 |
4 | 212320213121302201310 |
5 | 322240010431330400 |
6 | 5403320535110152 |
7 | 364024614305606 |
oct | 46704731624164 |
9 | 10413211348475 |
10 | 2672130730100 |
11 | 940276153517 |
12 | 371a63212358 |
13 | 164c99bc6460 |
14 | 93490715176 |
15 | 49795543835 |
hex | 26e27672874 |
2672130730100 has 144 divisors (see below), whose sum is σ = 6261117346176. Its totient is φ = 984021696000.
The previous prime is 2672130730069. The next prime is 2672130730147. The reversal of 2672130730100 is 10370312762.
2672130730100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 1019506790 + ... + 1019509410.
Almost surely, 22672130730100 is an apocalyptic number.
2672130730100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2672130730100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3130558673088).
2672130730100 is an abundant number, since it is smaller than the sum of its proper divisors (3588986616076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2672130730100 is a wasteful number, since it uses less digits than its factorization.
2672130730100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4426 (or 4419 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 32.
The spelling of 2672130730100 in words is "two trillion, six hundred seventy-two billion, one hundred thirty million, seven hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •