Base | Representation |
---|---|
bin | 10111001100111001101010… |
… | …100111001000011010000001 |
3 | 111101022002021001122211212101 |
4 | 113030321222213020122001 |
5 | 101333322220121130223 |
6 | 1001005135052230401 |
7 | 30331156340006545 |
oct | 2714715247103201 |
9 | 441262231584771 |
10 | 102041621661313 |
11 | 2a571677232164 |
12 | b54042476b401 |
13 | 44c263970ac79 |
14 | 1b2abab3a1a25 |
15 | bbe50b8114ad |
hex | 5cce6a9c8681 |
102041621661313 has 8 divisors (see below), whose sum is σ = 102087272687400. Its totient is φ = 101995971902208.
The previous prime is 102041621661307. The next prime is 102041621661401. The reversal of 102041621661313 is 313166126140201.
It can be written as a sum of positive squares in 4 ways, for example, as 9067614517504 + 92974007143809 = 3011248^2 + 9642303^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102041621661313 - 29 = 102041621660801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102041621668313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184927095 + ... + 185478067.
It is an arithmetic number, because the mean of its divisors is an integer number (12760909085925).
Almost surely, 2102041621661313 is an apocalyptic number.
It is an amenable number.
102041621661313 is a deficient number, since it is larger than the sum of its proper divisors (45651026087).
102041621661313 is an equidigital number, since it uses as much as digits as its factorization.
102041621661313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633491.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 102041621661313 in words is "one hundred two trillion, forty-one billion, six hundred twenty-one million, six hundred sixty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •