Base | Representation |
---|---|
bin | 11000010010101111… |
… | …01101101010111010 |
3 | 1020122221000222221000 |
4 | 30021113231222322 |
5 | 203202240110320 |
6 | 5554053425430 |
7 | 641124063450 |
oct | 141127555272 |
9 | 36587028830 |
10 | 13042113210 |
11 | 5592a29765 |
12 | 263b93b276 |
13 | 12cb028369 |
14 | 8ba1ac9d0 |
15 | 514ebec90 |
hex | 3095edaba |
13042113210 has 128 divisors (see below), whose sum is σ = 42085578240. Its totient is φ = 2805691392.
The previous prime is 13042113187. The next prime is 13042113211. The reversal of 13042113210 is 1231124031.
13042113210 is a `hidden beast` number, since 1 + 30 + 421 + 1 + 3 + 210 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (13042113211) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 170829 + ... + 235088.
It is an arithmetic number, because the mean of its divisors is an integer number (328793580).
Almost surely, 213042113210 is an apocalyptic number.
13042113210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13042113210 is an abundant number, since it is smaller than the sum of its proper divisors (29043465030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13042113210 is a wasteful number, since it uses less digits than its factorization.
13042113210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405957 (or 405951 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13042113210 its reverse (1231124031), we get a palindrome (14273237241).
The spelling of 13042113210 in words is "thirteen billion, forty-two million, one hundred thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •