Base | Representation |
---|---|
bin | 11000011010010100… |
… | …10101011101101010 |
3 | 1020211100201022020201 |
4 | 30031022111131222 |
5 | 203320030340200 |
6 | 10004244542414 |
7 | 642525511531 |
oct | 141512253552 |
9 | 36740638221 |
10 | 13105715050 |
11 | 561591a76a |
12 | 26590b1a0a |
13 | 130b26689c |
14 | 8c4807318 |
15 | 51a884c6a |
hex | 30d29576a |
13105715050 has 12 divisors (see below), whose sum is σ = 24376630086. Its totient is φ = 5242286000.
The previous prime is 13105715041. The next prime is 13105715057. The reversal of 13105715050 is 5051750131.
13105715050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 10463857849 + 2641857201 = 102293^2 + 51399^2 .
It is not an unprimeable number, because it can be changed into a prime (13105715057) 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 5 ways as a sum of consecutive naturals, for example, 131057101 + ... + 131057200.
Almost surely, 213105715050 is an apocalyptic number.
13105715050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13105715050 is a deficient number, since it is larger than the sum of its proper divisors (11270915036).
13105715050 is a wasteful number, since it uses less digits than its factorization.
13105715050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262114313 (or 262114308 counting only the distinct ones).
The product of its (nonzero) digits is 2625, while the sum is 28.
The spelling of 13105715050 in words is "thirteen billion, one hundred five million, seven hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •