Base | Representation |
---|---|
bin | 111000010010011100101… |
… | …111011000110011011101 |
3 | 111200210020120000100220201 |
4 | 320102130233120303131 |
5 | 1001333332130000321 |
6 | 12120551500143501 |
7 | 546314062333531 |
oct | 70223457306335 |
9 | 14623216010821 |
10 | 3868100234461 |
11 | 12614a7817581 |
12 | 5257b6b37b91 |
13 | 2209b6472ca8 |
14 | d530782bbc1 |
15 | 6a941483291 |
hex | 3849cbd8cdd |
3868100234461 has 2 divisors, whose sum is σ = 3868100234462. Its totient is φ = 3868100234460.
The previous prime is 3868100234431. The next prime is 3868100234491. The reversal of 3868100234461 is 1644320018683.
It is a balanced prime because it is at equal distance from previous prime (3868100234431) and next prime (3868100234491).
It can be written as a sum of positive squares in only one way, i.e., 2387315468836 + 1480784765625 = 1545094^2 + 1216875^2 .
It is a cyclic number.
It is not a de Polignac number, because 3868100234461 - 217 = 3868100103389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3868100234431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1934050117230 + 1934050117231.
It is an arithmetic number, because the mean of its divisors is an integer number (1934050117231).
Almost surely, 23868100234461 is an apocalyptic number.
It is an amenable number.
3868100234461 is a deficient number, since it is larger than the sum of its proper divisors (1).
3868100234461 is an equidigital number, since it uses as much as digits as its factorization.
3868100234461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 663552, while the sum is 46.
The spelling of 3868100234461 in words is "three trillion, eight hundred sixty-eight billion, one hundred million, two hundred thirty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •