Base | Representation |
---|---|
bin | 10011000101001010011… |
… | …101001110100010111101 |
3 | 11122100110202211220000201 |
4 | 103011022131032202331 |
5 | 132440331313413041 |
6 | 2442210302523501 |
7 | 163506052546114 |
oct | 23051235164275 |
9 | 4570422756021 |
10 | 1311214201021 |
11 | 4660a026241a |
12 | 192156b96591 |
13 | 9685450bb4a |
14 | 4766aa96c7b |
15 | 241936c6631 |
hex | 1314a74e8bd |
1311214201021 has 8 divisors (see below), whose sum is σ = 1353528687104. Its totient is φ = 1268900793360.
The previous prime is 1311214201009. The next prime is 1311214201051. The reversal of 1311214201021 is 1201024121131.
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 1311214201021 - 233 = 1302624266429 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 1311214201021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311214201051) 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, 2731951 + ... + 3175843.
It is an arithmetic number, because the mean of its divisors is an integer number (169191085888).
Almost surely, 21311214201021 is an apocalyptic number.
It is an amenable number.
1311214201021 is a deficient number, since it is larger than the sum of its proper divisors (42314486083).
1311214201021 is an equidigital number, since it uses as much as digits as its factorization.
1311214201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539211.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1311214201021 its reverse (1201024121131), we get a palindrome (2512238322152).
The spelling of 1311214201021 in words is "one trillion, three hundred eleven billion, two hundred fourteen million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •