Base | Representation |
---|---|
bin | 10011000111001110101… |
… | …001100100101110111110 |
3 | 11122120012100002021122000 |
4 | 103013032221210232332 |
5 | 133004402044431032 |
6 | 2443214330403130 |
7 | 163615033023201 |
oct | 23071651445676 |
9 | 4576170067560 |
10 | 1313432030142 |
11 | 46702915a251 |
12 | 1926758904a6 |
13 | 96b18b4377b |
14 | 477db455938 |
15 | 24273265e7c |
hex | 131cea64bbe |
1313432030142 has 16 divisors (see below), whose sum is σ = 2918737844880. Its totient is φ = 437810676696.
The previous prime is 1313432030123. The next prime is 1313432030167. The reversal of 1313432030142 is 2410302343131.
It is a happy number.
1313432030142 is a `hidden beast` number, since 1 + 3 + 1 + 34 + 320 + 301 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 12161407633 + ... + 12161407740.
It is an arithmetic number, because the mean of its divisors is an integer number (182421115305).
Almost surely, 21313432030142 is an apocalyptic number.
1313432030142 is an abundant number, since it is smaller than the sum of its proper divisors (1605305814738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313432030142 is a wasteful number, since it uses less digits than its factorization.
1313432030142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24322815384 (or 24322815378 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1313432030142 its reverse (2410302343131), we get a palindrome (3723734373273).
The spelling of 1313432030142 in words is "one trillion, three hundred thirteen billion, four hundred thirty-two million, thirty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •