Base | Representation |
---|---|
bin | 10100000001101001… |
… | …10011101000101000 |
3 | 1000202021101122210011 |
4 | 22000310303220220 |
5 | 134004310324344 |
6 | 4534500501304 |
7 | 530266132624 |
oct | 120064635050 |
9 | 30667348704 |
10 | 10751261224 |
11 | 4617896760 |
12 | 21006aa834 |
13 | 1024537042 |
14 | 73dc42184 |
15 | 42dd08d34 |
hex | 280d33a28 |
10751261224 has 64 divisors (see below), whose sum is σ = 22389281280. Its totient is φ = 4798752000.
The previous prime is 10751261221. The next prime is 10751261251. The reversal of 10751261224 is 42216215701.
It is not an unprimeable number, because it can be changed into a prime (10751261221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4148169 + ... + 4150759.
It is an arithmetic number, because the mean of its divisors is an integer number (349832520).
Almost surely, 210751261224 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10751261224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11194640640).
10751261224 is an abundant number, since it is smaller than the sum of its proper divisors (11638020056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10751261224 is a wasteful number, since it uses less digits than its factorization.
10751261224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3442 (or 3438 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 31.
Adding to 10751261224 its reverse (42216215701), we get a palindrome (52967476925).
The spelling of 10751261224 in words is "ten billion, seven hundred fifty-one million, two hundred sixty-one thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •