Base | Representation |
---|---|
bin | 11001011101001001… |
… | …10001001110100000 |
3 | 1022021102112121010200 |
4 | 30232210301032200 |
5 | 210442032331030 |
6 | 10140032025200 |
7 | 662443366530 |
oct | 145644611640 |
9 | 38242477120 |
10 | 13666292640 |
11 | 58832a1a30 |
12 | 2794992200 |
13 | 139a43b7c0 |
14 | 93904b4c0 |
15 | 54ebb6d60 |
hex | 32e9313a0 |
13666292640 has 1152 divisors, whose sum is σ = 66044160000. Its totient is φ = 2478366720.
The previous prime is 13666292623. The next prime is 13666292663. The reversal of 13666292640 is 4629266631.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 27387111 + ... + 27387609.
It is an arithmetic number, because the mean of its divisors is an integer number (57330000).
Almost surely, 213666292640 is an apocalyptic number.
13666292640 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 13666292640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33022080000).
13666292640 is an abundant number, since it is smaller than the sum of its proper divisors (52377867360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13666292640 is a wasteful number, since it uses less digits than its factorization.
13666292640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570 (or 559 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 45.
The spelling of 13666292640 in words is "thirteen billion, six hundred sixty-six million, two hundred ninety-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •