Base | Representation |
---|---|
bin | 10011011110111101… |
… | …01101100000111000 |
3 | 222222222211002002110 |
4 | 21233132231200320 |
5 | 132410311200222 |
6 | 4445543332320 |
7 | 520133466042 |
oct | 115736554070 |
9 | 28888732073 |
10 | 10460256312 |
11 | 44885a6430 |
12 | 203b1510a0 |
13 | ca916859c |
14 | 713330a92 |
15 | 4134c530c |
hex | 26f7ad838 |
10460256312 has 64 divisors (see below), whose sum is σ = 28538294400. Its totient is φ = 3168627840.
The previous prime is 10460256311. The next prime is 10460256337. The reversal of 10460256312 is 21365206401.
It is a super-2 number, since 2×104602563122 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10460256312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10460256311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 981798 + ... + 992394.
It is an arithmetic number, because the mean of its divisors is an integer number (445910850).
Almost surely, 210460256312 is an apocalyptic number.
10460256312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10460256312 is an abundant number, since it is smaller than the sum of its proper divisors (18078038088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10460256312 is a wasteful number, since it uses less digits than its factorization.
10460256312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14356 (or 14352 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 10460256312 in words is "ten billion, four hundred sixty million, two hundred fifty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •