Base | Representation |
---|---|
bin | 10001101000001001101… |
… | …100000011010001001101 |
3 | 11021210200121011110220122 |
4 | 101220021230003101031 |
5 | 124321312342221031 |
6 | 2324252231154325 |
7 | 153342134222153 |
oct | 21501154032115 |
9 | 4253617143818 |
10 | 1211343320141 |
11 | 4278007a7439 |
12 | 1769245159a5 |
13 | 8a2c9699c66 |
14 | 428b4c473d3 |
15 | 2179a99447b |
hex | 11a09b0344d |
1211343320141 has 8 divisors (see below), whose sum is σ = 1240375530240. Its totient is φ = 1182350266272.
The previous prime is 1211343320113. The next prime is 1211343320203. The reversal of 1211343320141 is 1410233431121.
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 1211343320141 - 218 = 1211343057997 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 1211343320141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211343320441) 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, 9726440 + ... + 9850193.
It is an arithmetic number, because the mean of its divisors is an integer number (155046941280).
Almost surely, 21211343320141 is an apocalyptic number.
It is an amenable number.
1211343320141 is a deficient number, since it is larger than the sum of its proper divisors (29032210099).
1211343320141 is a wasteful number, since it uses less digits than its factorization.
1211343320141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19578115.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1211343320141 its reverse (1410233431121), we get a palindrome (2621576751262).
The spelling of 1211343320141 in words is "one trillion, two hundred eleven billion, three hundred forty-three million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •