Base | Representation |
---|---|
bin | 1100010110000011100011… |
… | …1000000111010000110110 |
3 | 1210001120102020211220200111 |
4 | 3011200320320013100312 |
5 | 3234340102011424040 |
6 | 44511212401533234 |
7 | 2600422565653435 |
oct | 305407070072066 |
9 | 53046366756614 |
10 | 13573050889270 |
11 | 4363331418554 |
12 | 163266b34421a |
13 | 775c19342152 |
14 | 34cd2111311c |
15 | 1880ed672dea |
hex | c5838e07436 |
13573050889270 has 32 divisors (see below), whose sum is σ = 24439490281440. Its totient is φ = 5427443212800.
The previous prime is 13573050889267. The next prime is 13573050889289. The reversal of 13573050889270 is 7298805037531.
It is a super-2 number, since 2×135730508892702 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 467876526 + ... + 467905534.
It is an arithmetic number, because the mean of its divisors is an integer number (763734071295).
Almost surely, 213573050889270 is an apocalyptic number.
13573050889270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13573050889270 is a deficient number, since it is larger than the sum of its proper divisors (10866439392170).
13573050889270 is a wasteful number, since it uses less digits than its factorization.
13573050889270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42720.
The product of its (nonzero) digits is 12700800, while the sum is 58.
The spelling of 13573050889270 in words is "thirteen trillion, five hundred seventy-three billion, fifty million, eight hundred eighty-nine thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •