Base | Representation |
---|---|
bin | 10001011110000101100… |
… | …111010010000101100101 |
3 | 11020202210112012010100221 |
4 | 101132011213102011211 |
5 | 124132200102334023 |
6 | 2315304102004341 |
7 | 152510303512564 |
oct | 21360547220545 |
9 | 4222715163327 |
10 | 1200537543013 |
11 | 423166166116 |
12 | 1748097166b1 |
13 | 89296a861b3 |
14 | 4216ba93bdb |
15 | 21366ebc85d |
hex | 117859d2165 |
1200537543013 has 8 divisors (see below), whose sum is σ = 1226234367360. Its totient is φ = 1174847113440.
The previous prime is 1200537542989. The next prime is 1200537543031. The reversal of 1200537543013 is 3103457350021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1200537543013 - 221 = 1200535445861 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1200537543013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200537543713) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1218243 + ... + 1971088.
It is an arithmetic number, because the mean of its divisors is an integer number (153279295920).
Almost surely, 21200537543013 is an apocalyptic number.
It is an amenable number.
1200537543013 is a deficient number, since it is larger than the sum of its proper divisors (25696824347).
1200537543013 is an equidigital number, since it uses as much as digits as its factorization.
1200537543013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3197387.
The product of its (nonzero) digits is 37800, while the sum is 34.
The spelling of 1200537543013 in words is "one trillion, two hundred billion, five hundred thirty-seven million, five hundred forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •