Base | Representation |
---|---|
bin | 11000110010011101… |
… | …11100001111000000 |
3 | 1021100110211002122000 |
4 | 30121032330033000 |
5 | 204223402432044 |
6 | 10040321544000 |
7 | 650535151560 |
oct | 143116741700 |
9 | 37313732560 |
10 | 13308249024 |
11 | 570a183514 |
12 | 26b4aa5000 |
13 | 13411ca385 |
14 | 903688da0 |
15 | 52d53ed69 |
hex | 3193bc3c0 |
13308249024 has 112 divisors (see below), whose sum is σ = 44712940800. Its totient is φ = 3802353408.
The previous prime is 13308249023. The next prime is 13308249041. The reversal of 13308249024 is 42094280331.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 13308249024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13308249023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 538014 + ... + 562205.
Almost surely, 213308249024 is an apocalyptic number.
13308249024 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13308249024 is an abundant number, since it is smaller than the sum of its proper divisors (31404691776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13308249024 is a wasteful number, since it uses less digits than its factorization.
13308249024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100247 (or 1100231 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
It can be divided in two parts, 133082 and 49024, that added together give a triangular number (182106 = T603).
The spelling of 13308249024 in words is "thirteen billion, three hundred eight million, two hundred forty-nine thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •