Base | Representation |
---|---|
bin | 10011011101000011… |
… | …10101111100000000 |
3 | 222221212210102012010 |
4 | 21232201311330000 |
5 | 132342220100112 |
6 | 4444213332520 |
7 | 516551041215 |
oct | 115641657400 |
9 | 28855712163 |
10 | 10444300032 |
11 | 447a598221 |
12 | 2035937140 |
13 | ca5a6c8ba |
14 | 711179b0c |
15 | 411dc263c |
hex | 26e875f00 |
10444300032 has 72 divisors (see below), whose sum is σ = 27836491984. Its totient is φ = 3476496384.
The previous prime is 10444299997. The next prime is 10444300037. The reversal of 10444300032 is 23000344401.
It is a junction number, because it is equal to n+sod(n) for n = 10444299981 and 10444300008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10444300037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 553668 + ... + 572220.
Almost surely, 210444300032 is an apocalyptic number.
10444300032 is a gapful number since it is divisible by the number (12) 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 10444300032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13918245992).
10444300032 is an abundant number, since it is smaller than the sum of its proper divisors (17392191952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10444300032 is an equidigital number, since it uses as much as digits as its factorization.
10444300032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19305 (or 19291 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 10444300032 its reverse (23000344401), we get a palindrome (33444644433).
The spelling of 10444300032 in words is "ten billion, four hundred forty-four million, three hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •