Base | Representation |
---|---|
bin | 10010111001001100… |
… | …01010110001000000 |
3 | 222011220200100100022 |
4 | 21130212022301000 |
5 | 131233210202112 |
6 | 4354305113012 |
7 | 506235565061 |
oct | 113446126100 |
9 | 28156610308 |
10 | 10143444032 |
11 | 43357896a7 |
12 | 1b71028768 |
13 | c586322b7 |
14 | 6c3222568 |
15 | 3e5794d72 |
hex | 25c98ac40 |
10143444032 has 56 divisors (see below), whose sum is σ = 21339413760. Its totient is φ = 4775431680.
The previous prime is 10143444019. The next prime is 10143444049. The reversal of 10143444032 is 23044434101.
It is a junction number, because it is equal to n+sod(n) for n = 10143443992 and 10143444010.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4319 + ... + 142497.
It is an arithmetic number, because the mean of its divisors is an integer number (381060960).
Almost surely, 210143444032 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 10143444032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10669706880).
10143444032 is an abundant number, since it is smaller than the sum of its proper divisors (11195969728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10143444032 is a wasteful number, since it uses less digits than its factorization.
10143444032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138259 (or 138249 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 10143444032 its reverse (23044434101), we get a palindrome (33187878133).
The spelling of 10143444032 in words is "ten billion, one hundred forty-three million, four hundred forty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •