Base | Representation |
---|---|
bin | 1011111000111001111011… |
… | …1001001100110111001110 |
3 | 1201021200202200000200021110 |
4 | 2332032132321030313032 |
5 | 3203133432311324000 |
6 | 43445150452112450 |
7 | 2516303400333201 |
oct | 276163671146716 |
9 | 51250680020243 |
10 | 13072251276750 |
11 | 418aa02064366 |
12 | 15715a6605726 |
13 | 73a928648993 |
14 | 3329b3a25938 |
15 | 17a08c742850 |
hex | be39ee4cdce |
13072251276750 has 64 divisors (see below), whose sum is σ = 32634875520000. Its totient is φ = 3485235348000.
The previous prime is 13072251276743. The next prime is 13072251276779. The reversal of 13072251276750 is 5767215227031.
It is a self number, because there is not a number n which added to its sum of digits gives 13072251276750.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2005935 + ... + 5492565.
It is an arithmetic number, because the mean of its divisors is an integer number (509919930000).
Almost surely, 213072251276750 is an apocalyptic number.
13072251276750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13072251276750 is an abundant number, since it is smaller than the sum of its proper divisors (19562624243250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13072251276750 is a wasteful number, since it uses less digits than its factorization.
13072251276750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3491650 (or 3491640 counting only the distinct ones).
The product of its (nonzero) digits is 1234800, while the sum is 48.
The spelling of 13072251276750 in words is "thirteen trillion, seventy-two billion, two hundred fifty-one million, two hundred seventy-six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •