Base | Representation |
---|---|
bin | 10001111010110001101… |
… | …101010110100111011001 |
3 | 11100201022100101220120010 |
4 | 101322301231112213121 |
5 | 130133242034244001 |
6 | 2341400514352133 |
7 | 154650543116433 |
oct | 21726155264731 |
9 | 4321270356503 |
10 | 1231342103001 |
11 | 435233574a5a |
12 | 17a785b8b649 |
13 | 8c165a3989a |
14 | 43850cd3653 |
15 | 2206b56e8d6 |
hex | 11eb1b569d9 |
1231342103001 has 4 divisors (see below), whose sum is σ = 1641789470672. Its totient is φ = 820894735332.
The previous prime is 1231342102901. The next prime is 1231342103039. The reversal of 1231342103001 is 1003012431321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1231342103001 - 27 = 1231342102873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1231342123001) 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 3 ways as a sum of consecutive naturals, for example, 205223683831 + ... + 205223683836.
It is an arithmetic number, because the mean of its divisors is an integer number (410447367668).
Almost surely, 21231342103001 is an apocalyptic number.
It is an amenable number.
1231342103001 is a deficient number, since it is larger than the sum of its proper divisors (410447367671).
1231342103001 is an equidigital number, since it uses as much as digits as its factorization.
1231342103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410447367670.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1231342103001 its reverse (1003012431321), we get a palindrome (2234354534322).
The spelling of 1231342103001 in words is "one trillion, two hundred thirty-one billion, three hundred forty-two million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •