Base | Representation |
---|---|
bin | 10011001101010101… |
… | …00101110110000000 |
3 | 222121200112222000000 |
4 | 21212222211312000 |
5 | 132104432010210 |
6 | 4423142000000 |
7 | 513356514135 |
oct | 114652456600 |
9 | 28550488000 |
10 | 10312375680 |
11 | 4412081532 |
12 | 1bb9716000 |
13 | c8462c259 |
14 | 6db83858c |
15 | 405513ac0 |
hex | 266aa5d80 |
10312375680 has 672 divisors, whose sum is σ = 39854015280. Its totient is φ = 2545551360.
The previous prime is 10312375663. The next prime is 10312375681. The reversal of 10312375680 is 8657321301.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312375681) by changing a digit.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 332657265 + ... + 332657295.
Almost surely, 210312375680 is an apocalyptic number.
10312375680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10312375680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19927007640).
10312375680 is an abundant number, since it is smaller than the sum of its proper divisors (29541639600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10312375680 is an frugal number, since it uses more digits than its factorization.
10312375680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122 (or 64 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
Adding to 10312375680 its reverse (8657321301), we get a palindrome (18969696981).
The spelling of 10312375680 in words is "ten billion, three hundred twelve million, three hundred seventy-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •