Base | Representation |
---|---|
bin | 10001011110110100111… |
… | …010000111111011100101 |
3 | 11020211211211020111020022 |
4 | 101132310322013323211 |
5 | 124140311214330201 |
6 | 2315514524444525 |
7 | 152536050053321 |
oct | 21366472077345 |
9 | 4224754214208 |
10 | 1201331011301 |
11 | 423533045633 |
12 | 1749ab3a9745 |
13 | 89392290065 |
14 | 422051dc981 |
15 | 213b19a441b |
hex | 117b4e87ee5 |
1201331011301 has 8 divisors (see below), whose sum is σ = 1228290251520. Its totient is φ = 1174430063088.
The previous prime is 1201331011291. The next prime is 1201331011351. The reversal of 1201331011301 is 1031101331021.
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 1201331011301 - 210 = 1201331010277 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 1201331011301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201331011351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14531321 + ... + 14613758.
It is an arithmetic number, because the mean of its divisors is an integer number (153536281440).
Almost surely, 21201331011301 is an apocalyptic number.
It is an amenable number.
1201331011301 is a deficient number, since it is larger than the sum of its proper divisors (26959240219).
1201331011301 is an equidigital number, since it uses as much as digits as its factorization.
1201331011301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29146003.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1201331011301 its reverse (1031101331021), we get a palindrome (2232432342322).
The spelling of 1201331011301 in words is "one trillion, two hundred one billion, three hundred thirty-one million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •