Base | Representation |
---|---|
bin | 101111100011110010… |
… | …0010101110001001101 |
3 | 100202121210012112012012 |
4 | 1133013210111301031 |
5 | 3133131401041031 |
6 | 114530300351005 |
7 | 10243636263104 |
oct | 1370744256115 |
9 | 322553175165 |
10 | 102132440141 |
11 | 3a350110a26 |
12 | 17963b45465 |
13 | 9828548144 |
14 | 4d2c35303b |
15 | 29cb55db2b |
hex | 17c7915c4d |
102132440141 has 4 divisors (see below), whose sum is σ = 103362951552. Its totient is φ = 100901928732.
The previous prime is 102132440099. The next prime is 102132440143. The reversal of 102132440141 is 141044231201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141044231201 = 309539 ⋅455659.
It is a cyclic number.
It is not a de Polignac number, because 102132440141 - 210 = 102132439117 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 (102132440143) 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, 615255581 + ... + 615255746.
It is an arithmetic number, because the mean of its divisors is an integer number (25840737888).
Almost surely, 2102132440141 is an apocalyptic number.
It is an amenable number.
102132440141 is a deficient number, since it is larger than the sum of its proper divisors (1230511411).
102132440141 is an equidigital number, since it uses as much as digits as its factorization.
102132440141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230511410.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 102132440141 its reverse (141044231201), we get a palindrome (243176671342).
The spelling of 102132440141 in words is "one hundred two billion, one hundred thirty-two million, four hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •