Base | Representation |
---|---|
bin | 11001011110110011… |
… | …10111110101000000 |
3 | 1022022101201211201010 |
4 | 30233121313311000 |
5 | 211004113311222 |
6 | 10141250240520 |
7 | 663002615553 |
oct | 145731676500 |
9 | 38271654633 |
10 | 13680213312 |
11 | 589013a817 |
12 | 2799586140 |
13 | 13a02a3a9c |
14 | 93ac3269a |
15 | 55101680c |
hex | 32f677d40 |
13680213312 has 112 divisors (see below), whose sum is σ = 36861406592. Its totient is φ = 4476487680.
The previous prime is 13680213277. The next prime is 13680213329. The reversal of 13680213312 is 21331208631.
It is a self number, because there is not a number n which added to its sum of digits gives 13680213312.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 8865213 + ... + 8866755.
Almost surely, 213680213312 is an apocalyptic number.
13680213312 is a gapful number since it is divisible by the number (12) 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 13680213312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18430703296).
13680213312 is an abundant number, since it is smaller than the sum of its proper divisors (23181193280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13680213312 is a wasteful number, since it uses less digits than its factorization.
13680213312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376 (or 2366 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The spelling of 13680213312 in words is "thirteen billion, six hundred eighty million, two hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •