Base | Representation |
---|---|
bin | 11001011110111001… |
… | …00101101100000000 |
3 | 1022022110002000120020 |
4 | 30233130211230000 |
5 | 211004304103230 |
6 | 10141313413440 |
7 | 663011643000 |
oct | 145734455400 |
9 | 38273060506 |
10 | 13680925440 |
11 | 5890586856 |
12 | 279986a280 |
13 | 13a0492c70 |
14 | 93ad7a000 |
15 | 551107810 |
hex | 32f725b00 |
13680925440 has 1152 divisors, whose sum is σ = 59338137600. Its totient is φ = 2658926592.
The previous prime is 13680925411. The next prime is 13680925459. The reversal of 13680925440 is 4452908631.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 13680925392 and 13680925401.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 291083497 + ... + 291083543.
It is an arithmetic number, because the mean of its divisors is an integer number (51508800).
Almost surely, 213680925440 is an apocalyptic number.
13680925440 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 13680925440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29669068800).
13680925440 is an abundant number, since it is smaller than the sum of its proper divisors (45657212160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13680925440 is a wasteful number, since it uses less digits than its factorization.
13680925440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122 (or 94 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 13680925440 in words is "thirteen billion, six hundred eighty million, nine hundred twenty-five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •