Base | Representation |
---|---|
bin | 11000011010111010… |
… | …10111101100101100 |
3 | 1020211201002211002110 |
4 | 30031131113230230 |
5 | 203322320024230 |
6 | 10004543524020 |
7 | 642616103364 |
oct | 141535275454 |
9 | 36751084073 |
10 | 13110704940 |
11 | 5618718743 |
12 | 265a8b9610 |
13 | 130c2c2b98 |
14 | 8c53459a4 |
15 | 51b01d4b0 |
hex | 30d757b2c |
13110704940 has 24 divisors (see below), whose sum is σ = 36709974000. Its totient is φ = 3496187968.
The previous prime is 13110704911. The next prime is 13110704951. The reversal of 13110704940 is 4940701131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 13110704898 and 13110704907.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109255815 + ... + 109255934.
It is an arithmetic number, because the mean of its divisors is an integer number (1529582250).
Almost surely, 213110704940 is an apocalyptic number.
13110704940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13110704940 is an abundant number, since it is smaller than the sum of its proper divisors (23599269060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110704940 is a wasteful number, since it uses less digits than its factorization.
13110704940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218511761 (or 218511759 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 30.
The spelling of 13110704940 in words is "thirteen billion, one hundred ten million, seven hundred four thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •