Base | Representation |
---|---|
bin | 11000110011111000… |
… | …01010000110101000 |
3 | 1021101022010022021200 |
4 | 30121330022012220 |
5 | 204234421233222 |
6 | 10041424004200 |
7 | 651041000346 |
oct | 143174120650 |
9 | 37338108250 |
10 | 13320102312 |
11 | 571593a020 |
12 | 26b8a60660 |
13 | 13437ba65a |
14 | 905092996 |
15 | 52e5d1eac |
hex | 319f0a1a8 |
13320102312 has 96 divisors (see below), whose sum is σ = 39605885280. Its totient is φ = 4010647680.
The previous prime is 13320102287. The next prime is 13320102343. The reversal of 13320102312 is 21320102331.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70783 + ... + 177905.
It is an arithmetic number, because the mean of its divisors is an integer number (412561305).
Almost surely, 213320102312 is an apocalyptic number.
13320102312 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 13320102312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19802942640).
13320102312 is an abundant number, since it is smaller than the sum of its proper divisors (26285782968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320102312 is a wasteful number, since it uses less digits than its factorization.
13320102312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107303 (or 107296 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 13320102312 its reverse (21320102331), we get a palindrome (34640204643).
The spelling of 13320102312 in words is "thirteen billion, three hundred twenty million, one hundred two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •