Base | Representation |
---|---|
bin | 10111000000111100100110… |
… | …101011100100010110101101 |
3 | 111021101112212211001020121120 |
4 | 113000330212223210112231 |
5 | 101231342323131021031 |
6 | 555135520350251153 |
7 | 30214625336323521 |
oct | 2700744653442655 |
9 | 437345784036546 |
10 | 101220143220141 |
11 | 2a285249053740 |
12 | b4291851b6ab9 |
13 | 44630319a250a |
14 | 1add11c663d81 |
15 | ba7e7cab6a96 |
hex | 5c0f26ae45ad |
101220143220141 has 64 divisors (see below), whose sum is σ = 158836358246400. Its totient is φ = 56649436313600.
The previous prime is 101220143220047. The next prime is 101220143220149. The reversal of 101220143220141 is 141022341022101.
It is a cyclic number.
It is not a de Polignac number, because 101220143220141 - 213 = 101220143211949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220143220149) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14309740 + ... + 20179418.
It is an arithmetic number, because the mean of its divisors is an integer number (2481818097600).
Almost surely, 2101220143220141 is an apocalyptic number.
101220143220141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101220143220141 is a deficient number, since it is larger than the sum of its proper divisors (57616215026259).
101220143220141 is a wasteful number, since it uses less digits than its factorization.
101220143220141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5870290.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 101220143220141 its reverse (141022341022101), we get a palindrome (242242484242242).
The spelling of 101220143220141 in words is "one hundred one trillion, two hundred twenty billion, one hundred forty-three million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •