Base | Representation |
---|---|
bin | 11001010110101010… |
… | …10001111101101100 |
3 | 1022010122012012112100 |
4 | 30223111101331230 |
5 | 210334121311110 |
6 | 10130410135100 |
7 | 661213150632 |
oct | 145325217554 |
9 | 38118165470 |
10 | 13611900780 |
11 | 5855621585 |
12 | 277a721490 |
13 | 138c0a637a |
14 | 931b2d352 |
15 | 54a020bc0 |
hex | 32b551f6c |
13611900780 has 144 divisors (see below), whose sum is σ = 42608389824. Its totient is φ = 3515197440.
The previous prime is 13611900761. The next prime is 13611900791. The reversal of 13611900780 is 8700911631.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 47 ways as a sum of consecutive naturals, for example, 1004329 + ... + 1017791.
It is an arithmetic number, because the mean of its divisors is an integer number (295891596).
Almost surely, 213611900780 is an apocalyptic number.
13611900780 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 13611900780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21304194912).
13611900780 is an abundant number, since it is smaller than the sum of its proper divisors (28996489044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13611900780 is a wasteful number, since it uses less digits than its factorization.
13611900780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13656 (or 13651 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 36.
The spelling of 13611900780 in words is "thirteen billion, six hundred eleven million, nine hundred thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •