Base | Representation |
---|---|
bin | 10010110110011110… |
… | …10101101111010000 |
3 | 222010022211221022200 |
4 | 21123033111233100 |
5 | 131211343314243 |
6 | 4352133203200 |
7 | 505541244552 |
oct | 113317255720 |
9 | 28108757280 |
10 | 10120682448 |
11 | 4323952578 |
12 | 1b65490500 |
13 | c539c2bc6 |
14 | 6c01b94d2 |
15 | 3e379aad3 |
hex | 25b3d5bd0 |
10120682448 has 60 divisors (see below), whose sum is σ = 28346117280. Its totient is φ = 3370909248.
The previous prime is 10120682441. The next prime is 10120682461. The reversal of 10120682448 is 84428602101.
10120682448 is a `hidden beast` number, since 1 + 0 + 1 + 206 + 8 + 2 + 448 = 666.
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 (10120682441) 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 11 ways as a sum of consecutive naturals, for example, 160663 + ... + 214601.
It is an arithmetic number, because the mean of its divisors is an integer number (472435288).
Almost surely, 210120682448 is an apocalyptic number.
10120682448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10120682448 is an abundant number, since it is smaller than the sum of its proper divisors (18225434832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120682448 is a wasteful number, since it uses less digits than its factorization.
10120682448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55256 (or 55247 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 36.
The spelling of 10120682448 in words is "ten billion, one hundred twenty million, six hundred eighty-two thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •