Base | Representation |
---|---|
bin | 10011100010000010100… |
… | …100100010000010010111 |
3 | 11202022111122111120001020 |
4 | 103202002210202002113 |
5 | 133442331411123111 |
6 | 2504335121332223 |
7 | 165654321151623 |
oct | 23420244420227 |
9 | 4668448446036 |
10 | 1342220411031 |
11 | 478261480975 |
12 | 19816aa97073 |
13 | 997561a6886 |
14 | 48d6c9c8183 |
15 | 24daa80b906 |
hex | 13882922097 |
1342220411031 has 8 divisors (see below), whose sum is σ = 1790604626304. Its totient is φ = 894324901560.
The previous prime is 1342220411027. The next prime is 1342220411039. The reversal of 1342220411031 is 1301140222431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1342220411031 - 22 = 1342220411027 is a prime.
It is a super-2 number, since 2×13422204110312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1342220410992 and 1342220411010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342220411039) 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, 122170041 + ... + 122181026.
It is an arithmetic number, because the mean of its divisors is an integer number (223825578288).
Almost surely, 21342220411031 is an apocalyptic number.
1342220411031 is a deficient number, since it is larger than the sum of its proper divisors (448384215273).
1342220411031 is a wasteful number, since it uses less digits than its factorization.
1342220411031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244352901.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1342220411031 its reverse (1301140222431), we get a palindrome (2643360633462).
The spelling of 1342220411031 in words is "one trillion, three hundred forty-two billion, two hundred twenty million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •