Base | Representation |
---|---|
bin | 10001011110110101100… |
… | …101001111110001100101 |
3 | 11020211212121111210211211 |
4 | 101132311211033301211 |
5 | 124140322113044441 |
6 | 2315520011031421 |
7 | 152536245124450 |
oct | 21366545176145 |
9 | 4224777453754 |
10 | 1201342315621 |
11 | 423539466748 |
12 | 1749b313b571 |
13 | 8939471a4c6 |
14 | 42206902497 |
15 | 213b2988a81 |
hex | 117b594fc65 |
1201342315621 has 8 divisors (see below), whose sum is σ = 1410069745280. Its totient is φ = 1001891660688.
The previous prime is 1201342315597. The next prime is 1201342315627. The reversal of 1201342315621 is 1265132431021.
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 1201342315621 - 219 = 1201341791333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201342315627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2319193401 + ... + 2319193918.
It is an arithmetic number, because the mean of its divisors is an integer number (176258718160).
Almost surely, 21201342315621 is an apocalyptic number.
It is an amenable number.
1201342315621 is a deficient number, since it is larger than the sum of its proper divisors (208727429659).
1201342315621 is an equidigital number, since it uses as much as digits as its factorization.
1201342315621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4638387363.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 1201342315621 its reverse (1265132431021), we get a palindrome (2466474746642).
The spelling of 1201342315621 in words is "one trillion, two hundred one billion, three hundred forty-two million, three hundred fifteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •