Base | Representation |
---|---|
bin | 11101011010000101111… |
… | …11010110110000111011 |
3 | 10120121010101102022110201 |
4 | 32231002333112300323 |
5 | 113023340423003011 |
6 | 2052105034023031 |
7 | 133000450436101 |
oct | 16550277266073 |
9 | 3517111368421 |
10 | 1010441219131 |
11 | 35a5867a9413 |
12 | 1439b6877a77 |
13 | 743904ca006 |
14 | 36c9701dc71 |
15 | 1b43d22acc1 |
hex | eb42fd6c3b |
1010441219131 has 2 divisors, whose sum is σ = 1010441219132. Its totient is φ = 1010441219130.
The previous prime is 1010441219113. The next prime is 1010441219167. The reversal of 1010441219131 is 1319121440101.
Together with previous prime (1010441219113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1010441219131 - 213 = 1010441210939 is a prime.
It is a super-2 number, since 2×10104412191312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1010441219131.
It is not a weakly prime, because it can be changed into another prime (1010441219101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505220609565 + 505220609566.
It is an arithmetic number, because the mean of its divisors is an integer number (505220609566).
Almost surely, 21010441219131 is an apocalyptic number.
1010441219131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010441219131 is an equidigital number, since it uses as much as digits as its factorization.
1010441219131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 28.
Adding to 1010441219131 its reverse (1319121440101), we get a palindrome (2329562659232).
The spelling of 1010441219131 in words is "one trillion, ten billion, four hundred forty-one million, two hundred nineteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •