Base | Representation |
---|---|
bin | 11101101110100001110… |
… | …10000110010001101101 |
3 | 10121122102222010211211111 |
4 | 32313100322012101231 |
5 | 113213323001441031 |
6 | 2101121422552021 |
7 | 133536354640411 |
oct | 16672072062155 |
9 | 3548388124744 |
10 | 1021412140141 |
11 | 3641a6585788 |
12 | 145b58a38611 |
13 | 7541b3b2953 |
14 | 376180c0d41 |
15 | 1b8814741b1 |
hex | edd0e8646d |
1021412140141 has 4 divisors (see below), whose sum is σ = 1027316256732. Its totient is φ = 1015508023552.
The previous prime is 1021412140123. The next prime is 1021412140153. The reversal of 1021412140141 is 1410412141201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 841787900100 + 179624240041 = 917490^2 + 423821^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021412140141 - 229 = 1020875269229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021412140171) 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, 2952058036 + ... + 2952058381.
It is an arithmetic number, because the mean of its divisors is an integer number (256829064183).
Almost surely, 21021412140141 is an apocalyptic number.
It is an amenable number.
1021412140141 is a deficient number, since it is larger than the sum of its proper divisors (5904116591).
1021412140141 is an equidigital number, since it uses as much as digits as its factorization.
1021412140141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5904116590.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 1021412140141 its reverse (1410412141201), we get a palindrome (2431824281342).
The spelling of 1021412140141 in words is "one trillion, twenty-one billion, four hundred twelve million, one hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •