Base | Representation |
---|---|
bin | 11101001001000101110… |
… | …10011001010000110110 |
3 | 10112201120020021111002010 |
4 | 32210202322121100312 |
5 | 112401142124110032 |
6 | 2043555155025050 |
7 | 132225321013146 |
oct | 16444272312066 |
9 | 3481506244063 |
10 | 1001313113142 |
11 | 35672216a271 |
12 | 14208989b186 |
13 | 73567345374 |
14 | 3666c9bc926 |
15 | 1b0a6b96ccc |
hex | e922e99436 |
1001313113142 has 16 divisors (see below), whose sum is σ = 2014912278720. Its totient is φ = 331723362312.
The previous prime is 1001313113131. The next prime is 1001313113153. The reversal of 1001313113142 is 2413113131001.
It is an interprime number because it is at equal distance from previous prime (1001313113131) and next prime (1001313113153).
It is a super-2 number, since 2×10013131131422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 511917792 + ... + 511919747.
It is an arithmetic number, because the mean of its divisors is an integer number (125932017420).
Almost surely, 21001313113142 is an apocalyptic number.
1001313113142 is an abundant number, since it is smaller than the sum of its proper divisors (1013599165578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001313113142 is a wasteful number, since it uses less digits than its factorization.
1001313113142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1023837707.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1001313113142 its reverse (2413113131001), we get a palindrome (3414426244143).
The spelling of 1001313113142 in words is "one trillion, one billion, three hundred thirteen million, one hundred thirteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •