Base | Representation |
---|---|
bin | 11110000000111111010… |
… | …01001001011001100110 |
3 | 10122121000200020021101120 |
4 | 33000133221021121212 |
5 | 113344122143444032 |
6 | 2105441103434410 |
7 | 134340101060355 |
oct | 17003751113146 |
9 | 3577020207346 |
10 | 1031323031142 |
11 | 368421a67898 |
12 | 147a63bb5a06 |
13 | 7633a7a08b1 |
14 | 37cb848999c |
15 | 1bc615ce62c |
hex | f01fa49666 |
1031323031142 has 8 divisors (see below), whose sum is σ = 2062646062296. Its totient is φ = 343774343712.
The previous prime is 1031323031113. The next prime is 1031323031143. The reversal of 1031323031142 is 2411303231301.
1031323031142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1031323031142 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031323031143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85943585923 + ... + 85943585934.
It is an arithmetic number, because the mean of its divisors is an integer number (257830757787).
Almost surely, 21031323031142 is an apocalyptic number.
1031323031142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031323031142 is a wasteful number, since it uses less digits than its factorization.
1031323031142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171887171862.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1031323031142 its reverse (2411303231301), we get a palindrome (3442626262443).
The spelling of 1031323031142 in words is "one trillion, thirty-one billion, three hundred twenty-three million, thirty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •