Base | Representation |
---|---|
bin | 10010111001010011… |
… | …00110010111111110 |
3 | 222011222101001020210 |
4 | 21130221212113332 |
5 | 131233422443200 |
6 | 4354340253250 |
7 | 506246332425 |
oct | 113451462776 |
9 | 28158331223 |
10 | 10144343550 |
11 | 4336243500 |
12 | 1b713a1226 |
13 | c58888863 |
14 | 6c33b82bc |
15 | 3e58c1650 |
hex | 25ca665fe |
10144343550 has 144 divisors (see below), whose sum is σ = 28608012720. Its totient is φ = 2374310400.
The previous prime is 10144343549. The next prime is 10144343597. The reversal of 10144343550 is 5534344101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 516714 + ... + 535986.
It is an arithmetic number, because the mean of its divisors is an integer number (198666755).
Almost surely, 210144343550 is an apocalyptic number.
10144343550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10144343550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14304006360).
10144343550 is an abundant number, since it is smaller than the sum of its proper divisors (18463669170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10144343550 is a wasteful number, since it uses less digits than its factorization.
10144343550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19339 (or 19323 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 10144343550 its reverse (5534344101), we get a palindrome (15678687651).
The spelling of 10144343550 in words is "ten billion, one hundred forty-four million, three hundred forty-three thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •