Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …11110110110101110010 |
3 | 10120122121210210001112200 |
4 | 32231211203312311302 |
5 | 113031032412304132 |
6 | 2052242353204030 |
7 | 133021022342331 |
oct | 16554543666562 |
9 | 3518553701480 |
10 | 1011021213042 |
11 | 35a854132425 |
12 | 143b38b60616 |
13 | 7445370c789 |
14 | 36d10079d18 |
15 | 1b4740e5d7c |
hex | eb658f6d72 |
1011021213042 has 12 divisors (see below), whose sum is σ = 2190545961630. Its totient is φ = 337007071008.
The previous prime is 1011021213011. The next prime is 1011021213043. The reversal of 1011021213042 is 2403121201101.
It can be written as a sum of positive squares in only one way, i.e., 1005309027801 + 5712185241 = 1002651^2 + 75579^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 56167845169 = 1011021213042 / (1 + 0 + 1 + 1 + 0 + 2 + 1 + 2 + 1 + 3 + 0 + 4 + 2).
It is not an unprimeable number, because it can be changed into a prime (1011021213043) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 28083922567 + ... + 28083922602.
Almost surely, 21011021213042 is an apocalyptic number.
1011021213042 is an abundant number, since it is smaller than the sum of its proper divisors (1179524748588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011021213042 is a wasteful number, since it uses less digits than its factorization.
1011021213042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56167845177 (or 56167845174 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1011021213042 its reverse (2403121201101), we get a palindrome (3414142414143).
The spelling of 1011021213042 in words is "one trillion, eleven billion, twenty-one million, two hundred thirteen thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •