Base | Representation |
---|---|
bin | 11101000110101100011… |
… | …01010111100011101101 |
3 | 10112121020112210121201121 |
4 | 32203112031113203231 |
5 | 112341023204210021 |
6 | 2043223344540541 |
7 | 132151403541115 |
oct | 16432615274355 |
9 | 3477215717647 |
10 | 1000026241261 |
11 | 356121819393 |
12 | 14198a921751 |
13 | 733c0855a08 |
14 | 36589b18045 |
15 | 1b02dbeb741 |
hex | e8d63578ed |
1000026241261 has 4 divisors (see below), whose sum is σ = 1004318199612. Its totient is φ = 995734282912.
The previous prime is 1000026241241. The next prime is 1000026241283. The reversal of 1000026241261 is 1621426200001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 329928467236 + 670097774025 = 574394^2 + 818595^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000026241261 - 25 = 1000026241229 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 (1000026241211) 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 in 3 ways as a sum of consecutive naturals, for example, 2145978826 + ... + 2145979291.
It is an arithmetic number, because the mean of its divisors is an integer number (251079549903).
Almost surely, 21000026241261 is an apocalyptic number.
It is an amenable number.
1000026241261 is a deficient number, since it is larger than the sum of its proper divisors (4291958351).
1000026241261 is an equidigital number, since it uses as much as digits as its factorization.
1000026241261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4291958350.
The product of its (nonzero) digits is 1152, while the sum is 25.
The spelling of 1000026241261 in words is "one trillion, twenty-six million, two hundred forty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •