Base | Representation |
---|---|
bin | 11101011101011010100… |
… | …01011000100110011101 |
3 | 10120202201122122201221020 |
4 | 32232231101120212131 |
5 | 113041013412031031 |
6 | 2053002012154353 |
7 | 133062601562343 |
oct | 16565521304635 |
9 | 3522648581836 |
10 | 1012224330141 |
11 | 360311278082 |
12 | 144213a689b9 |
13 | 745b5a5599b |
14 | 36dc5b7b993 |
15 | 1b4e4a4a096 |
hex | ebad45899d |
1012224330141 has 16 divisors (see below), whose sum is σ = 1369814816448. Its totient is φ = 664725600000.
The previous prime is 1012224330133. The next prime is 1012224330149. The reversal of 1012224330141 is 1410334222101.
It is an interprime number because it is at equal distance from previous prime (1012224330133) and next prime (1012224330149).
It is not a de Polignac number, because 1012224330141 - 23 = 1012224330133 is a prime.
It is a super-2 number, since 2×10122243301412 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012224330149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14034231 + ... + 14106171.
It is an arithmetic number, because the mean of its divisors is an integer number (85613426028).
Almost surely, 21012224330141 is an apocalyptic number.
It is an amenable number.
1012224330141 is a deficient number, since it is larger than the sum of its proper divisors (357590486307).
1012224330141 is an equidigital number, since it uses as much as digits as its factorization.
1012224330141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142012.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1012224330141 its reverse (1410334222101), we get a palindrome (2422558552242).
The spelling of 1012224330141 in words is "one trillion, twelve billion, two hundred twenty-four million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •