Base | Representation |
---|---|
bin | 11000010110100111… |
… | …11100110101010000 |
3 | 1020202012022121202200 |
4 | 30023103330311100 |
5 | 203234104244133 |
6 | 10001215443200 |
7 | 642000645663 |
oct | 141323746520 |
9 | 36665277680 |
10 | 13074681168 |
11 | 55aa35352a |
12 | 264a826500 |
13 | 13049bc143 |
14 | 8c06496da |
15 | 517ca4913 |
hex | 30b4fcd50 |
13074681168 has 120 divisors (see below), whose sum is σ = 37055211648. Its totient is φ = 4303293696.
The previous prime is 13074681107. The next prime is 13074681187. The reversal of 13074681168 is 86118647031.
13074681168 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3773805 + ... + 3777267.
Almost surely, 213074681168 is an apocalyptic number.
13074681168 is a gapful number since it is divisible by the number (18) 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 13074681168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18527605824).
13074681168 is an abundant number, since it is smaller than the sum of its proper divisors (23980530480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13074681168 is a wasteful number, since it uses less digits than its factorization.
13074681168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3801 (or 3792 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The spelling of 13074681168 in words is "thirteen billion, seventy-four million, six hundred eighty-one thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •