Base | Representation |
---|---|
bin | 10010110100001011… |
… | …11010010001100000 |
3 | 222001222121222122110 |
4 | 21122011322101200 |
5 | 131141431332230 |
6 | 4350204435320 |
7 | 505215524160 |
oct | 113205722140 |
9 | 28058558573 |
10 | 10101433440 |
11 | 4313aa54aa |
12 | 1b5ab48b40 |
13 | c4ca13567 |
14 | 6bb8085a0 |
15 | 3e1c474b0 |
hex | 25a17a460 |
10101433440 has 192 divisors, whose sum is σ = 36706328064. Its totient is φ = 2287239168.
The previous prime is 10101433423. The next prime is 10101433477. The reversal of 10101433440 is 4433410101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 345472 + ... + 373568.
It is an arithmetic number, because the mean of its divisors is an integer number (191178792).
Almost surely, 210101433440 is an apocalyptic number.
10101433440 is a gapful number since it is divisible by the number (10) 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 10101433440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18353164032).
10101433440 is an abundant number, since it is smaller than the sum of its proper divisors (26604894624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101433440 is a wasteful number, since it uses less digits than its factorization.
10101433440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28229 (or 28221 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10101433440 its reverse (4433410101), we get a palindrome (14534843541).
The spelling of 10101433440 in words is "ten billion, one hundred one million, four hundred thirty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •