Base | Representation |
---|---|
bin | 11000110011110001… |
… | …01111110011101000 |
3 | 1021101020102212202020 |
4 | 30121320233303220 |
5 | 204234204130133 |
6 | 10041352504440 |
7 | 651030254460 |
oct | 143170576350 |
9 | 37336385666 |
10 | 13319208168 |
11 | 5715389262 |
12 | 26b86ab120 |
13 | 1343566686 |
14 | 904cdcba0 |
15 | 52e4a70b3 |
hex | 319e2fce8 |
13319208168 has 128 divisors (see below), whose sum is σ = 38338379520. Its totient is φ = 3777269760.
The previous prime is 13319208143. The next prime is 13319208173. The reversal of 13319208168 is 86180291331.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 31 ways as a sum of consecutive naturals, for example, 20149758 + ... + 20150418.
It is an arithmetic number, because the mean of its divisors is an integer number (299518590).
Almost surely, 213319208168 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13319208168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19169189760).
13319208168 is an abundant number, since it is smaller than the sum of its proper divisors (25019171352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13319208168 is a wasteful number, since it uses less digits than its factorization.
13319208168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1387 (or 1383 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 42.
Adding to 13319208168 its reverse (86180291331), we get a palindrome (99499499499).
The spelling of 13319208168 in words is "thirteen billion, three hundred nineteen million, two hundred eight thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •