Base | Representation |
---|---|
bin | 10111010000101100010010… |
… | …010000001000001001110011 |
3 | 111102012222200111021110210012 |
4 | 113100230102100020021303 |
5 | 101402104231323203021 |
6 | 1001324541210125135 |
7 | 30356041130261033 |
oct | 2720542220101163 |
9 | 442188614243705 |
10 | 102302132241011 |
11 | 2a6620aa70350a |
12 | b582a091207ab |
13 | 45110851a4a91 |
14 | 1b39641a838c3 |
15 | bc61a724135b |
hex | 5d0b12408273 |
102302132241011 has 4 divisors (see below), whose sum is σ = 102302155833024. Its totient is φ = 102302108649000.
The previous prime is 102302132240993. The next prime is 102302132241053. The reversal of 102302132241011 is 110142231203201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102302132241011 - 26 = 102302132240947 is a prime.
It is a super-2 number, since 2×1023021322410112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102302132241061) 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, 3206840 + ... + 14659061.
It is an arithmetic number, because the mean of its divisors is an integer number (25575538958256).
Almost surely, 2102302132241011 is an apocalyptic number.
102302132241011 is a deficient number, since it is larger than the sum of its proper divisors (23592013).
102302132241011 is an equidigital number, since it uses as much as digits as its factorization.
102302132241011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23592012.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 102302132241011 its reverse (110142231203201), we get a palindrome (212444363444212).
The spelling of 102302132241011 in words is "one hundred two trillion, three hundred two billion, one hundred thirty-two million, two hundred forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •