Base | Representation |
---|---|
bin | 10100001110101000… |
… | …11011110001110100 |
3 | 1001000212102002211110 |
4 | 22013110123301310 |
5 | 134220203343122 |
6 | 4553352035020 |
7 | 533061210414 |
oct | 120724336164 |
9 | 31025362743 |
10 | 10860215412 |
11 | 4673343642 |
12 | 2131092a70 |
13 | 1040c94387 |
14 | 7504c4644 |
15 | 43867b90c |
hex | 28751bc74 |
10860215412 has 24 divisors (see below), whose sum is σ = 25434712800. Its totient is φ = 3606613216.
The previous prime is 10860215393. The next prime is 10860215447. The reversal of 10860215412 is 21451206801.
10860215412 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10860215412.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 1678962 + ... + 1685417.
It is an arithmetic number, because the mean of its divisors is an integer number (1059779700).
Almost surely, 210860215412 is an apocalyptic number.
10860215412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10860215412 is an abundant number, since it is smaller than the sum of its proper divisors (14574497388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10860215412 is a wasteful number, since it uses less digits than its factorization.
10860215412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3364655 (or 3364653 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
The spelling of 10860215412 in words is "ten billion, eight hundred sixty million, two hundred fifteen thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •