Base | Representation |
---|---|
bin | 10011100010001111110… |
… | …110011111010001110010 |
3 | 11202100002011202112102011 |
4 | 103202033312133101302 |
5 | 133443310431102010 |
6 | 2504413201113134 |
7 | 165662665053643 |
oct | 23421766372162 |
9 | 4670064675364 |
10 | 1342443222130 |
11 | 47836622417a |
12 | 1982116287aa |
13 | 997903b996a |
14 | 48d904276ca |
15 | 24dc016ea8a |
hex | 1388fd9f472 |
1342443222130 has 8 divisors (see below), whose sum is σ = 2416397799852. Its totient is φ = 536977288848.
The previous prime is 1342443222083. The next prime is 1342443222161. The reversal of 1342443222130 is 312223442431.
It can be written as a sum of positive squares in 2 ways, for example, as 1339790045049 + 2653177081 = 1157493^2 + 51509^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1342443222092 and 1342443222101.
It is an unprimeable number.
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, 67122161097 + ... + 67122161116.
Almost surely, 21342443222130 is an apocalyptic number.
1342443222130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1342443222130 is a deficient number, since it is larger than the sum of its proper divisors (1073954577722).
1342443222130 is a wasteful number, since it uses less digits than its factorization.
1342443222130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134244322220.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 1342443222130 its reverse (312223442431), we get a palindrome (1654666664561).
The spelling of 1342443222130 in words is "one trillion, three hundred forty-two billion, four hundred forty-three million, two hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •