Base | Representation |
---|---|
bin | 11000011011111011… |
… | …00100010101000000 |
3 | 1020212021222122001122 |
4 | 30031331210111000 |
5 | 203332000122110 |
6 | 10005444451412 |
7 | 643050615653 |
oct | 141575442500 |
9 | 36767878048 |
10 | 13119145280 |
11 | 562246302a |
12 | 26616a9b68 |
13 | 1310c89877 |
14 | 8c650189a |
15 | 51bb39255 |
hex | 30df64540 |
13119145280 has 112 divisors (see below), whose sum is σ = 32422429440. Its totient is φ = 5050214400.
The previous prime is 13119145267. The next prime is 13119145301. The reversal of 13119145280 is 8254191131.
It is a happy number.
It is a super-2 number, since 2×131191452802 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13119145280.
It is a congruent number.
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, 3069545 + ... + 3073815.
Almost surely, 213119145280 is an apocalyptic number.
13119145280 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 13119145280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16211214720).
13119145280 is an abundant number, since it is smaller than the sum of its proper divisors (19303284160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13119145280 is a wasteful number, since it uses less digits than its factorization.
13119145280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4648 (or 4638 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 35.
The spelling of 13119145280 in words is "thirteen billion, one hundred nineteen million, one hundred forty-five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •