Base | Representation |
---|---|
bin | 11000111101111000… |
… | …11011111010001000 |
3 | 1021121011002212101120 |
4 | 30132330123322020 |
5 | 204422414430240 |
6 | 10054023315240 |
7 | 653110432656 |
oct | 143674337210 |
9 | 37534085346 |
10 | 13404061320 |
11 | 5759274731 |
12 | 2720babb20 |
13 | 1358005a40 |
14 | 9122a9dd6 |
15 | 536b68ad0 |
hex | 31ef1be88 |
13404061320 has 128 divisors (see below), whose sum is σ = 44039721600. Its totient is φ = 3243515904.
The previous prime is 13404061291. The next prime is 13404061337. The reversal of 13404061320 is 2316040431.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 31 ways as a sum of consecutive naturals, for example, 19224 + ... + 164856.
It is an arithmetic number, because the mean of its divisors is an integer number (344060325).
Almost surely, 213404061320 is an apocalyptic number.
13404061320 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 13404061320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22019860800).
13404061320 is an abundant number, since it is smaller than the sum of its proper divisors (30635660280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13404061320 is a wasteful number, since it uses less digits than its factorization.
13404061320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145719 (or 145715 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The spelling of 13404061320 in words is "thirteen billion, four hundred four million, sixty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •