Base | Representation |
---|---|
bin | 1001010101100001110000… |
… | …0110001010010011000100 |
3 | 1100100100220101110200200020 |
4 | 2111120130012022103010 |
5 | 2321142111430331112 |
6 | 33455513550215140 |
7 | 2106440152422162 |
oct | 225303406122304 |
9 | 40310811420606 |
10 | 10265443214532 |
11 | 32a8606090990 |
12 | 11996181b44b0 |
13 | 59604782577c |
14 | 276bc8978232 |
15 | 12c06391e48c |
hex | 9561c18a4c4 |
10265443214532 has 48 divisors (see below), whose sum is σ = 26141353335552. Its totient is φ = 3109414862880.
The previous prime is 10265443214503. The next prime is 10265443214561. The reversal of 10265443214532 is 23541234456201.
It is an interprime number because it is at equal distance from previous prime (10265443214503) and next prime (10265443214561).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16257838 + ... + 16877445.
It is an arithmetic number, because the mean of its divisors is an integer number (544611527824).
Almost surely, 210265443214532 is an apocalyptic number.
10265443214532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10265443214532 is an abundant number, since it is smaller than the sum of its proper divisors (15875910121020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10265443214532 is a wasteful number, since it uses less digits than its factorization.
10265443214532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33137648 (or 33137646 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 42.
The spelling of 10265443214532 in words is "ten trillion, two hundred sixty-five billion, four hundred forty-three million, two hundred fourteen thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •