Base | Representation |
---|---|
bin | 11000011010111101… |
… | …00000011110010000 |
3 | 1020211201122221222121 |
4 | 30031132200132100 |
5 | 203322404044044 |
6 | 10004554144024 |
7 | 642621454420 |
oct | 141536403620 |
9 | 36751587877 |
10 | 13111003024 |
11 | 5618901699 |
12 | 265aa22014 |
13 | 130c398772 |
14 | 8c53c2480 |
15 | 51b07b984 |
hex | 30d7a0790 |
13111003024 has 80 divisors (see below), whose sum is σ = 30964232448. Its totient is φ = 5249765376.
The previous prime is 13111003019. The next prime is 13111003039. The reversal of 13111003024 is 42030011131.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 13111002989 and 13111003007.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 235717 + ... + 285979.
Almost surely, 213111003024 is an apocalyptic number.
13111003024 is a gapful number since it is divisible by the number (14) 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 13111003024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15482116224).
13111003024 is an abundant number, since it is smaller than the sum of its proper divisors (17853229424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111003024 is a wasteful number, since it uses less digits than its factorization.
13111003024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50432 (or 50426 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13111003024 its reverse (42030011131), we get a palindrome (55141014155).
The spelling of 13111003024 in words is "thirteen billion, one hundred eleven million, three thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •