Base | Representation |
---|---|
bin | 11000011010010111… |
… | …11011000001101010 |
3 | 1020211101111102220010 |
4 | 30031023323001222 |
5 | 203320132143200 |
6 | 10004301512350 |
7 | 642532163415 |
oct | 141513730152 |
9 | 36741442803 |
10 | 13106131050 |
11 | 5616084271 |
12 | 26592726b6 |
13 | 130b38103c |
14 | 8c48b4b7c |
15 | 51a918150 |
hex | 30d2fb06a |
13106131050 has 48 divisors (see below), whose sum is σ = 32595413760. Its totient is φ = 3485053440.
The previous prime is 13106130991. The next prime is 13106131057. The reversal of 13106131050 is 5013160131.
13106131050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (13106131057) by changing a digit.
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, 70810 + ... + 176709.
It is an arithmetic number, because the mean of its divisors is an integer number (679071120).
Almost surely, 213106131050 is an apocalyptic number.
13106131050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13106131050 is an abundant number, since it is smaller than the sum of its proper divisors (19489282710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13106131050 is a wasteful number, since it uses less digits than its factorization.
13106131050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247887 (or 247882 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 13106131050 its reverse (5013160131), we get a palindrome (18119291181).
The spelling of 13106131050 in words is "thirteen billion, one hundred six million, one hundred thirty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •