Base | Representation |
---|---|
bin | 11000011010001111… |
… | …10011010111011100 |
3 | 1020211022110120110222 |
4 | 30031013303113130 |
5 | 203314343113400 |
6 | 10004222420512 |
7 | 642520045031 |
oct | 141507632734 |
9 | 36738416428 |
10 | 13105051100 |
11 | 5615506949 |
12 | 2658a31738 |
13 | 130b09360b |
14 | 8c46b3388 |
15 | 51a7a3185 |
hex | 30d1f35dc |
13105051100 has 18 divisors (see below), whose sum is σ = 28437961104. Its totient is φ = 5242020400.
The previous prime is 13105051097. The next prime is 13105051121. The reversal of 13105051100 is 115050131.
It is a super-2 number, since 2×131050511002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 65525156 + ... + 65525355.
It is an arithmetic number, because the mean of its divisors is an integer number (1579886728).
Almost surely, 213105051100 is an apocalyptic number.
13105051100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13105051100 is an abundant number, since it is smaller than the sum of its proper divisors (15332910004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13105051100 is a wasteful number, since it uses less digits than its factorization.
13105051100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131050525 (or 131050518 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 17.
The spelling of 13105051100 in words is "thirteen billion, one hundred five million, fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •